Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Mutual-visibility in strong products of graphs via total mutual-visibility
Authors:ID Cicerone, Serafino (Author)
ID Di Stefano, Gabriele (Author)
ID Klavžar, Sandi (Author)
ID Yero, Ismael G. (Author)
Files:.pdf PDF - Presentation file, download (618,95 KB)
MD5: 9F622F07C0DA768E2A9136C1680C2F92
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0166218X24002907
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Let G be a graph and X⊆V(G). Then X is a mutual-visibility set if each pair of vertices from X is connected by a geodesic with no internal vertex in X. The mutual-visibility number μ(G) of G is the cardinality of a largest mutual-visibility set. In this paper, the mutual-visibility number of strong product graphs is investigated. As a tool for this, total mutual-visibility sets are introduced. Along the way, basic properties of such sets are presented. The (total) mutual-visibility number of strong products is bounded from below in two ways, and determined exactly for strong grids of arbitrary dimension. Strong prisms are studied separately and a couple of tight bounds for their mutual-visibility number are given.
Keywords:mutual-visibility set, mutual-visibility number, total mutual-visibility set, strong product of graphs
Publication status:Published
Publication version:Version of Record
Publication date:01.12.2024
Year of publishing:2024
Number of pages:str. 136-146
Numbering:Vol. 358
PID:20.500.12556/DiRROS-20505 New window
UDC:519.17
ISSN on article:0166-218X
DOI:10.1016/j.dam.2024.06.038 New window
COBISS.SI-ID:201822467 New window
Note:
Publication date in DiRROS:02.10.2024
Views:365
Downloads:169
Metadata:XML DC-XML DC-RDF
:
CICERONE, Serafino, DI STEFANO, Gabriele, KLAVŽAR, Sandi and YERO, Ismael G., 2024, Mutual-visibility in strong products of graphs via total mutual-visibility. Discrete applied mathematics [online]. 2024. Vol. 358, p. 136–146. [Accessed 21 April 2025]. DOI 10.1016/j.dam.2024.06.038. Retrieved from: https://dirros.openscience.si/IzpisGradiva.php?lang=eng&id=20505
Copy citation
  
Share:Bookmark and Share


Similar works from our repository:

No similar works found
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete applied mathematics
Shortened title:Discrete appl. math.
Publisher:Elsevier
ISSN:0166-218X
COBISS.SI-ID:25342464 New window

Document is financed by a project

Funder:Other - Other funder or multiple funders
Funding programme:European Union - NextGenerationEU
Project number:ECS00000041 - VITALITY - CUP J97G22000170005
Name:Italian Ministry of University and Research (MUR) National Innovation Ecosystem
Funder:Other - Other funder or multiple funders
Funding programme:Italian National Group for Scientific Computation
Acronym:GNCS-INdAM
Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov
Funder:ARRS - Slovenian Research Agency
Project number:N1-0218
Name:Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov
Funder:ARRS - Slovenian Research Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih
Funder:Other - Other funder or multiple funders
Funding programme:Spanish Ministry of Science and Innovation
Project number:PID2019-105824GB-I00
Funder:Other - Other funder or multiple funders
Funding programme:Ministerio de Educación, Cultura y Deporte, Spain
Project number:CAS21/00100
Name:“José Castillejo” program for young researchers

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Vzajemna vidnost v krepkih produktih grafov skozi celotno medsebojno vidnost
Keywords:množica vzajemne vidnosti, število vzajemne vidnosti, množica celotne vzajemne vidnosti, krepki produkt grafov


Back