Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
Given a connected graph \(G\), the total mutual-visibility number of \(G\), denoted \(\mu_t(G)\), is the cardinality of a largest set \(S\subseteq V(G)\) such that for every pair of vertices \(x,y\in V(G)\) there is a shortest \(x,y\)-path whose interior vertices are not contained in \(S\). Several combinatorial properties, including bounds and clo...
Alternative Titles
Full title
Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2831118219
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2831118219
Other Identifiers
E-ISSN
2331-8422
