Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
Mutual-visibility problems in Kneser and Johnson graphs
Gülnaz Boruzanlı Ekinci, Csilla Bujtás
Izvirni znanstveni članek
Oznake: mutual-visibility set;total mutual-visibility set;Kneser graph;bipartite Kneser graph;Johnson graph;Turán-type problem;covering design;
Let G be a connected graph and X ⊆ V(G). By definition, two vertices u and v are X-visible in G if there exists a shortest u, v-path with all internal vertices being outside of the set X. The largest size of X such that any two vertices of G (resp. any two vertices from X) are X-visible is the total ...
Leto: 2025 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: