Isbn: 9783843392839 - Domination in Circulant Graphs: Domination, Connected, Total and Independent Domination in Circulant Graphs (3 results)

- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 101.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 36.36
£ 42.13 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Tamizh Chelvam TT.TAMIZH CHELVAM is Professor of Mathematics at Manonmaniam Sundaranar University, India. As a result of his intensive research since 1987, he has authored 55 refereed papers on Algebra & Graph Theory. I.RANI is .…

Language: English
Published by LAP LAMBERT Academic Publishing Feb 2011, 2011
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 43.41
£ 51.60 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Parallel processing and supercomputing continue to exert great influence in the development of modern science and engineering. The network of processors and interconnections play a vital role in facilitating the communication between processors in a parallel computer. Some of the popular interconnection schemes are rings, toroids and hypercubes. Their popularity stems from the commercial availability of machines with these architectures. These three families of graphs viz., rings, toroids and hypercubes share a common property of being a Cayley graph. Many important problems in networks have been modeled by Cayley graphs. One of the principal issues concerning routing problems is identification of perfect dominating sets in Cayley graphs. Circulant graphs are Cayley graphs constructed on finite cyclic groups. This book deals with domination in circulant graphs in general and some methodologies to determine dominating sets, independent dominating sets, total dominating sets and connected dominating sets in circulant graphs constructed from certain specified generating sets in particular. Domination in directed circulant graph is also dealt with.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 104 pp. Englisch.…