Some results on one type of graph family with some special number sequences
Emrullah Kirklar, A. Dilek Maden, Fatih Yilmaz
AKCE International Journal of Graphs and Combinatorics · 2020
doi:10.1016/j.akcej.2019.09.005 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this study, we introduce a new graph family. Then, we calculate eigenvalues of the adjacency and the Laplacian matrix of this graph family. Moreover, we show that the perfect matching number of this graph family equals to special second order recurrence by hafnian method. For some special kinds of this family, we obtain that the perfect matching number of corresponding graphs equals to some famous number sequences such as Fibonacci, Pell and Jacobsthal numbers. Also, we find energies and obtain upper bounds for Laplacian energies of these graphs.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.