Digitalni repozitorij raziskovalnih organizacij Slovenije

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po

Možnosti:
  Ponastavi


Iskalni niz: "ključne besede" (Cartesian product of graphs) .

1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
General position polynomials
Vesna Iršič, Sandi Klavžar, Gregor Rus, James Tuite, 2024, izvirni znanstveni članek

Povzetek: A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\sum_{i \geq 0} a_i x^i$, where $a_i$ is the number of distinct general position sets of $G$ with cardinality $i$. The polynomial is considered for several well-known classes of graphs and graph operations. It is shown that the polynomial is not unimodal in general, not even on trees. On the other hand, several classes of graphs, including Kneser graphs $K(n,2)$, with unimodal general position polynomials are presented.
Ključne besede: general position set, general position number, general position polynomial, unimodality, trees, Cartesian product of graphs, Kneser graphs
Objavljeno v DiRROS: 28.02.2024; Ogledov: 119; Prenosov: 80
.pdf Celotno besedilo (384,07 KB)
Gradivo ima več datotek! Več...

2.
Strong edge geodetic problem on complete multipartite graphs and some extremal graphs for the problem
Sandi Klavžar, Eva Zmazek, 2024, izvirni znanstveni članek

Povzetek: A set of vertices $X$ of a graph $G$ is a strong edge geodetic set if to any pair of vertices from $X$ we can assign one (or zero) shortest path between them such that every edge of $G$ is contained in at least one on these paths. The cardinality of a smallest strong edge geodetic set of $G$ is the strong edge geodetic number ${\rm sg_e}(G)$ of $G$. In this paper, the strong edge geodetic number of complete multipartite graphs is determined. Graphs $G$ with ${\rm sg_e}(G) = n(G)$ are characterized and ${\rm sg_e}$ is determined for Cartesian products $P_n\,\square\, K_m$. The latter result in particular corrects an error from the literature.
Ključne besede: strong edge geodetic problem, complete multipartite graph, edge-coloring, Cartesian product of graphs
Objavljeno v DiRROS: 19.02.2024; Ogledov: 143; Prenosov: 49
.pdf Celotno besedilo (430,75 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.07 sek.
Na vrh