Results 1 to 10 of about 880 (146)

The Mostar and Wiener index of Alternate Lucas Cubes [PDF]

Transactions on Combinatorics, 2023
The Wiener index and the Mostar index quantify two distance related properties of connected graphs: the Wiener index is the sum of the distances over all pairs of vertices and the Mostar index is a measure of how far the graph is from being distance ...
Omer Eğecioğlu, Elif Sayg, Zülfükar Sayg   +2 more
doaj   +5 more sources

Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes [PDF]

Discrete Mathematics & Theoretical Computer Science, 2015
Graph ...
Jernej Azarija, Sandi Klavžar, Jaehun Lee, Yoomi Rho   +3 more
doaj   +5 more sources

Horadam–Lucas Cubes

Axioms
In this paper, we introduce a novel class of graphs referred to as the Horadam–Lucas cubes. This class extends the concept of Lucas cubes and retains numerous desirable properties associated with them.
Elif Tan, Luka Podrug, Vesna Iršič Chenoweth   +2 more
doaj   +3 more sources

The Larger Bound on the Domination Number of Fibonacci Cubes and Lucas Cubes [PDF]

Journal of Applied Mathematics, 2014
Let Γn and Λn be the n-dimensional Fibonacci cube and Lucas cube, respectively. Denote by Γ[un,k,z] the subgraph of Γn induced by the end-vertex un,k,z that has no up-neighbor.
Shengzhang Ren
doaj   +3 more sources

The (non-)existence of perfect codes in Lucas cubes

پژوهش‌های ریاضی, 2022
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring.
Azam Ghaleh Agha Babai,
doaj   +7 more sources

Alternate Lucas Cubes

International Journal of Foundations of Computer Science, 2021
We introduce alternate Lucas cubes, a new family of graphs designed as an alternative for the well known Lucas cubes. These interconnection networks are subgraphs of Fibonacci cubes and have a useful fundamental decomposition similar to the one for Fibonacci cubes.
Ömer Eğecioğlu, Elif Saygı, Zülfükar Saygı   +2 more
openaire   +3 more sources

Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes

Discrete Mathematics, Algorithms and Applications, 2023
The diameter of a graph is the maximum distance between pairs of vertices in the graph. A pair of vertices whose distance is equal to its diameter is called diametrically opposite vertices. The collection of shortest paths between diametrically opposite vertices is referred as diametral paths.
Ömer Eğeci̇oğlu, Elif Saygi, Zülfükar Saygi   +2 more
openaire   +4 more sources

The Mostar Index of Fibonacci and Lucas Cubes [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2021
The Mostar index of a graph was defined by Došlić, Martinjak, Škrekovski, Tipurić Spužević and Zubac in the context of the study of the properties of chemical graphs. It measures how far a given graph is from being distance-balanced. In this paper, we determine the Mostar index of two well-known families of graphs: Fibonacci cubes and Lucas cubes.
Ömer Eğecioğlu, Elif Saygı, Zülfükar Saygı   +2 more
openaire   +5 more sources

Soil Data Cube and Artificial Intelligence Techniques for Generating National-Scale Topsoil Thematic Maps: A Case Study in Lithuanian Croplands

Remote Sensing, 2023
There is a growing realization among policymakers that in order to pave the way for the development of evidence-based conservation recommendations for policy, it is essential to improve the capacity for soil-health monitoring by adopting multidimensional
Nikiforos Samarinas, Nikolaos L. Tsakiridis, Stylianos Kokkas, Eleni Kalopesa, George C. Zalidis   +4 more
doaj   +1 more source

Cube Polynomial of Fibonacci and Lucas Cubes [PDF]

Acta Applicandae Mathematicae, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klavžar, Sandi, Mollard, Michel
openaire   +2 more sources