Podrobno

Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
ID Bujtás, Csilla (Avtor), ID Klavžar, Sandi (Avtor), ID Tian, Jing (Avtor)

.pdfPDF - Predstavitvena datoteka, prenos (418,55 KB)
MD5: 1946EA5E94FA5B0654C901725CE4118A
URLURL - Izvorni URL, za dostop obiščite https://link.springer.com/article/10.1007/s00010-025-01197-y Povezava se odpre v novem oknu

Izvleček
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.

Jezik:Angleški jezik
Ključne besede:mutual-visibility sets, variety of mutual-visibility sets, convex subgraphs, integer polynomial
Vrsta gradiva:Članek v reviji
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:FMF - Fakulteta za matematiko in fiziko
Status publikacije:Objavljeno
Različica publikacije:Objavljena publikacija
Datum objave:01.08.2025
Leto izida:2025
Št. strani:Str. 1883–1901
Številčenje:Vol. 99, iss. 4
PID:20.500.12556/RUL-174515 Povezava se odpre v novem oknu
UDK:519.17
ISSN pri članku:0001-9054
DOI:10.1007/s00010-025-01197-y Povezava se odpre v novem oknu
COBISS.SI-ID:251531267 Povezava se odpre v novem oknu
Datum objave v RUL:03.10.2025
Število ogledov:147
Število prenosov:39
Metapodatki:XML DC-XML DC-RDF
:
Kopiraj citat
Objavi na:Bookmark and Share

Gradivo je del revije

Naslov:Aequationes mathematicae
Skrajšan naslov:Aequ. math.
Založnik:Springer
ISSN:0001-9054
COBISS.SI-ID:1327364 Povezava se odpre v novem oknu

Sekundarni jezik

Jezik:Slovenski jezik
Ključne besede:množice vzajemne vidnosti, raznolikost množic vzajemne vidnosti, konveksni podgrafi, celoštevilski polinom

Projekti

Financer:ARIS - Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Številka projekta:P1-0297
Naslov:Teorija grafov

Financer:ARIS - Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Številka projekta:N1-0355
Naslov:Prirejanja, transverzale in hipergrafi

Financer:ARIS - Javna agencija za znanstvenoraziskovalno in inovacijsko dejavnost Republike Slovenije
Številka projekta:N1-0285
Naslov:Metrični problemi v grafih in hipergrafih

Podobna dela

Podobna dela v RUL:
Podobna dela v drugih slovenskih zbirkah:

Nazaj