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: "keywords" (Fibonacci cubes) .

1 - 2 / 2
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: 95; Downloads: 40
.pdf Full text (345,71 KB)
This document has many files! More...

2.
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: 96; Downloads: 50
.pdf Full text (424,01 KB)
This document has many files! More...
Search done in 0.04 sec.
Back to top