Digital repository of Slovenian research organisations

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

Title:Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
Authors:ID Bujtás, Csilla (Author)
ID Klavžar, Sandi (Author)
ID Tian, Jing (Author)
Files:.pdf PDF - Presentation file, download (424,32 KB)
MD5: 1B493CB1CF4F1C1A732EBC0B7129170D
 
URL URL - Source URL, visit https://link.springer.com/article/10.1007/s00010-025-01197-y
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such sets to convex and isometric subgraphs are studied. Dual mutual-visibility sets are shown to be intrinsically different from other types of mutual-visibility sets. It is proved that for every finite subset $Z$ of positive integers there exists a graph $G$ that has a dual mutual-visibility set of size ▫$i$▫ if and only if $i\in Z\cup \{0\}$, while for the other types of mutual-visibility such a set consists of consecutive integers. Visibility polynomials are introduced and their properties derived. As a surprise, every polynomial with nonnegative integer coefficients and with a constant term $1$ is a dual visibility polynomial of some graph. Characterizations are given for total mutual-visibility sets, for graphs with total mutual-visibility number $1$, and for sets which are not total mutual-visibility sets, yet every proper subset is such. Along the way an earlier result from the literature is corrected.
Keywords:mutual-visibility sets, variety of mutual-visibility sets, convex subgraphs, integer polynomial
Publication status:Published
Publication version:Version of Record
Publication date:01.08.2025
Year of publishing:2025
Number of pages:str. 1883–1901
Numbering:Vol. 99, iss. 4
PID:20.500.12556/DiRROS-23804 New window
UDC:519.17
ISSN on article:0001-9054
DOI:10.1007/s00010-025-01197-y New window
COBISS.SI-ID:251531267 New window
Note:
Publication date in DiRROS:03.10.2025
Views:252
Downloads:128
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:Aequationes mathematicae
Shortened title:Aequ. math.
Publisher:Birkhäuser
ISSN:0001-9054
COBISS.SI-ID:1327364 New window

Document is financed by a project

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

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0355
Name:Prirejanja, transverzale in hipergrafi

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

Secondary language

Language:Slovenian
Keywords:množice vzajemne vidnosti, raznolikost množic vzajemne vidnosti, konveksni podgrafi, celoštevilski polinom


Back