Distances and Domination in Graphs

doi:10.3390/books978-3-03943-516-6

Book License

Download Url(s)

https://mdpi.com/books/pdfview/book/3089

Contributor(s)

González Yero, Ismael (editor)

Language

English

Show full item record

Abstract

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.

URI

https://directory.doabooks.org/handle/20.500.12854/69299

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; rooted product graph; Roman domination number; perfect Roman domination number; strong resolving graph; strong metric dimension; strong resolving set; cactus graphs; unicyclic graphs; network science; network curvature; discrete Ricci curvature; earth-mover’s distance