Digital repository of Slovenian research organisations

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

Title:Mutual-visibility and general position in double graphs and in Mycielskians
Authors:ID Roy, Dhanya (Author)
ID Klavžar, Sandi (Author)
ID Lakshmanan S., Aparna (Author)
Files:.pdf PDF - Presentation file, download (816,77 KB)
MD5: CCF4A02E1ACFD47BE5766044C67A0A7D
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0096300324005927
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:The general position problem in graphs is to find the largest possible set of vertices with the property that no three of them lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of vertices that can be selected such that every pair of vertices in the collection has a shortest path between them with no vertex from the collection as an internal vertex. Here, the general position problem and the mutual-visibility problem are investigated in double graphs and in Mycielskian graphs. Sharp general bounds are proved, in particular involving the total and the outer mutual-visibility number of base graphs. Several exact values are also determined, in particular the mutual-visibility number of the double graphs and of the Mycielskian of cycles.
Keywords:general position, mutual-visibility, double graph, Mycielskian graph, outer mutual-visibility, total mutual-visibility
Publication status:Published
Publication version:Version of Record
Publication date:01.03.2025
Year of publishing:2025
Number of pages:9 str.
Numbering:Vol. 488, [article no.] 129131
PID:20.500.12556/DiRROS-20568 New window
UDC:519.17
ISSN on article:0096-3003
DOI:10.1016/j.amc.2024.129131 New window
COBISS.SI-ID:212344835 New window
Note:Spletna objava: 17. 10. 2024;
Publication date in DiRROS:23.10.2024
Views:116
Downloads:60
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


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:Applied mathematics and computation
Shortened title:Appl. math. comput.
Publisher:Elsevier
ISSN:0096-3003
COBISS.SI-ID:24983808 New window

Document is financed by a project

Funder:Other - Other funder or multiple funders
Funding programme:Cochin University of Science and Technology, University JRF Scheme

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0218
Name:Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

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
Keywords:splošna lega, vzajemna vidnost, dvojni graf, graf Mycielskega, zunanja vzajemna vidnost, celotna vzajemna vidnost


Back