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: "avtor" (Vesna Iršič) .

1 - 3 / 3
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Domination and independence numbers of large 2-crossing-critical graphs
Vesna Iršič, Maruša Lekše, Miha Pačnik, Petra Podlogar, Martin Praček, 2023, izvirni znanstveni članek

Povzetek: After 2-crossing-critical graphs were characterized in 2016, their most general subfamily, large 3-connected 2-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.
Ključne besede: crossing-critical graphs, domination number, independence number
Objavljeno v DiRROS: 09.04.2024; Ogledov: 57; Prenosov: 33
.pdf Celotno besedilo (393,09 KB)
Gradivo ima več datotek! Več...

2.
Generalized Pell graphs
Vesna Iršič, Sandi Klavžar, Elif Tan, 2023, izvirni znanstveni članek

Povzetek: In this paper, generalized Pell graphs $\Pi_{n,k}$, $k\ge 2$, are introduced. The special case of $k=2$ are the Pell graphs $\Pi_{n}$ defined earlier by Munarini. Several metric, enumerative, and structural properties of these graphs are established. The generating function of the number of edges of $\Pi_{n,k}$ and the generating function of its cube polynomial are determined. The center of $\Pi_{n,k}$ is explicitly described; if $k$ is even, then it induces the Fibonacci cube $\Gamma_{n}$. It is also shown that $\Pi_{n,k}$ is a median graph, and that $\Pi_{n,k}$ embeds into a Fibonacci cube.
Ključne besede: Fibonacci cubes, Pell graphs, generating functions, center of graph, median graphs, k-Fibonacci sequence
Objavljeno v DiRROS: 08.04.2024; Ogledov: 83; Prenosov: 34
.pdf Celotno besedilo (345,71 KB)
Gradivo ima več datotek! Več...

3.
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: 118; Prenosov: 80
.pdf Celotno besedilo (384,07 KB)
Gradivo ima več datotek! Več...
Iskanje izvedeno v 0.09 sek.
Na vrh