Modified fibonomial graphs

In this paper, a new graph type similar to binomial graphs is constructed using fibonomial coefficients. The spectrum of this new graph was obtained, the energy of the graph and the sum of the Laplacian eigenvalues are calculated. In addition, the connectivity feature of the graph is examined and the properties of the vertices forming the graph are revealed.

Authors

Institutions

Publication Details

Journal
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics
Published
2024-12-26
DOI
https://doi.org/10.31801/cfsuasmas.1537286
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modified fibonomial graphs

Semih Yılmaz, Gökçe Dicle Karaağaç
Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics
Graph theory and applications
article

Modified fibonomial graphs

Semih Yılmaz, Gökçe Dicle Karaağaç
article en

Abstract

In this paper, a new graph type similar to binomial graphs is constructed using fibonomial coefficients. The spectrum of this new graph was obtained, the energy of the graph and the sum of the Laplacian eigenvalues are calculated. In addition, the connectivity feature of the graph is examined and the properties of the vertices forming the graph are revealed.

Communications Faculty Of Science University of Ankara Series A1Mathematics and StatisticsVol. 74(1)
Kırıkkale University (TR)
Openalex Percentile: Top 61%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.