Digitalni repozitorij raziskovalnih organizacij Slovenije

Izpis gradiva
A+ | A- | Pomoč | SLO | ENG

Naslov:Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
Avtorji:ID Bujtás, Csilla (Avtor)
ID Klavžar, Sandi (Avtor)
ID Tian, Jing (Avtor)
Datoteke:.pdf PDF - Predstavitvena datoteka, prenos (424,32 KB)
MD5: 1B493CB1CF4F1C1A732EBC0B7129170D
 
URL URL - Izvorni URL, za dostop obiščite https://link.springer.com/article/10.1007/s00010-025-01197-y
 
Jezik:Angleški jezik
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:Logo IMFM - Inštitut za matematiko, fiziko in mehaniko
Povzetek: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.
Ključne besede:mutual-visibility sets, variety of mutual-visibility sets, convex subgraphs, integer polynomial
Status publikacije:Objavljeno
Verzija 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/DiRROS-23804 Novo okno
UDK:519.17
ISSN pri članku:0001-9054
DOI:10.1007/s00010-025-01197-y Novo okno
COBISS.SI-ID:251531267 Novo okno
Opomba:
Datum objave v DiRROS:03.10.2025
Število ogledov:254
Število prenosov:132
Metapodatki:XML DC-XML DC-RDF
:
Kopiraj citat
  
Objavi na:Bookmark and Share


Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Aequationes mathematicae
Skrajšan naslov:Aequ. math.
Založnik:Birkhäuser
ISSN:0001-9054
COBISS.SI-ID:1327364 Novo okno

Gradivo je financirano iz projekta

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

Sekundarni jezik

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


Nazaj