Reprint
Distances and Domination in Graphs
Edited by
November 2020
146 pages
- ISBN978-3-03943-515-9 (Hardback)
- ISBN978-3-03943-516-6 (PDF)
This book is a reprint of the Special Issue Distances and Domination in Graphs that was published in
Computer Science & Mathematics
Engineering
Physical Sciences
Public Health & Healthcare
Summary
This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of graphs. The topics of the gathered publications deal with some new open lines of investigations that cover not only graphs, but also digraphs. Different variations in dominating sets or resolving sets are appearing, and a review on some networks’ curvatures is also present.
Format
- Hardback
License
© 2021 by the authors; CC BY license
Keywords
independent domination; stable graph; tree; unicyclic graph; graph; automorphism group; determining number; cograph; unit interval graph; simultaneous strong resolving set; simultaneous strong metric dimension; simultaneous strong resolving graph; total outer k-independent domination; total domination; k-independence; total Roman domination; Roman domination; semitotal domination; domination; efficient open domination; digraphs; products of digraphs; secure total domination; total domination; domination; rooted product graph; Roman domination number; perfect Roman domination number; tree; strong resolving graph; strong metric dimension; strong resolving set; cactus graphs; unicyclic graphs; network science; network curvature; discrete Ricci curvature; earth-mover’s distance