Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in

Options:
  Reset


Query: "author" (Elif Tan) .

1 - 3 / 3
First pagePrevious page1Next pageLast page
1.
Generalized Pell graphs
Vesna Iršič, Sandi Klavžar, Elif Tan, 2023, original scientific article

Abstract: 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.
Keywords: Fibonacci cubes, Pell graphs, generating functions, center of graph, median graphs, k-Fibonacci sequence
Published in DiRROS: 08.04.2024; Views: 86; Downloads: 37
.pdf Full text (345,71 KB)
This document has many files! More...

2.
Extremal edge general position sets in some graphs
Jing Tian, Sandi Klavžar, Elif Tan, 2024, original scientific article

Abstract: A set of edges $X\subseteq E(G)$ of a graph $G$ is an edge general position set if no three edges from $X$ lie on a common shortest path. The edge general position number ${\rm gp}_{\rm e}(G)$ of $G$ is the cardinality of a largest edge general position set in $G$. Graphs $G$ with ${\rm gp}_{\rm e}(G) = |E(G)| - 1$ and with ${\rm gp}_{\rm e}(G) = 3$ are respectively characterized. Sharp upper and lower bounds on ${\rm gp}_{\rm e}(G)$ are proved for block graphs $G$ and exact values are determined for several specific block graphs.
Keywords: general position set, edge general position set, cut-vertex, diametral path, block graphs
Published in DiRROS: 27.03.2024; Views: 107; Downloads: 46
.pdf Full text (304,95 KB)
This document has many files! More...

3.
Edge general position sets in Fibonacci and Lucas cubes
Sandi Klavžar, Elif Tan, 2023, original scientific article

Abstract: A set of edges $X\subseteq E(G)$ of a graph $G$ is an edge general position set if no three edges from $X$ lie on a common shortest path in $G$. The cardinality of a largest edge general position set of $G$ is the edge general position number of $G$. In this paper edge general position sets are investigated in partial cubes. In particular it is proved that the union of two largest $\Theta$-classes of a Fibonacci cube or a Lucas cube is a maximal edge general position set.
Keywords: general position set, edge general position sets, partial cubes, Fibonacci cubes, Lucas cubes
Published in DiRROS: 18.03.2024; Views: 90; Downloads: 48
.pdf Full text (424,01 KB)
This document has many files! More...

Search done in 0.1 sec.
Back to top