Total Domination in Graphs
Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured in
- PDF / 2,068,567 Bytes
- 184 Pages / 439.42 x 683.15 pts Page_size
- 17 Downloads / 340 Views
Michael A. Henning Anders Yeo
Total Domination in Graphs
Springer Monographs in Mathematics
For further volumes: http://www.springer.com/series/3733
Michael A. Henning • Anders Yeo
Total Domination in Graphs
123
Michael A. Henning Department of Mathematics University of Johannesburg South Africa
Anders Yeo Department of Mathematics University of Johannesburg South Africa
ISSN 1439-7382 ISBN 978-1-4614-6524-9 ISBN 978-1-4614-6525-6 (eBook) DOI 10.1007/978-1-4614-6525-6 Springer New York Heidelberg Dordrecht London Library of Congress Control Number: 2013931652 Mathematics Subject Classification (2010): 05C69, 05C65 © Springer Science+Business Media New York 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
We dedicate this book to our wives, Anne and Angela, and to our parents, Joy and Cosmo Henning and Gunnel and Geoffrey Yeo, with heartfelt thanks, for their love, support, encouragement, and patience.
Preface
In 1998 Teresa Haynes, Stephen Hedetniemi, and Peter Slater [85, 86] wrote the two so-called “domination books” and in so doing provided the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs. They did an outstanding job of unifying results scattered through some 1,200 domination paper
Data Loading...
