Skip to main content
SpringerLink
Log in

Lucas graphs

  • Original Research
  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Special number sequences play important role in many areas of science. One of them named as Fibonacci sequence dates back to 820 years ago. There is a lot of research on Fibonacci numbers due to their relation with the golden ratio and also due to many applications in Chemistry, Physics, Biology, Anthropology, Social Sciences, Architecture, Anatomy, Finance, etc. A slight variant of the Fibonacci sequence was obtained in the eighteenth century by Lucas and therefore named as Lucas sequence. There are very natural close relations between graph theory and other areas of Mathematics including number theory. Recently Fibonacci graphs have been introduced as graphs having consecutive Fibonacci numbers as vertex degrees. In that paper, graph theory was connected with number theory by means of a new graph invariant called \(\varOmega (D)\) for a realizable degree sequence D defined recently. \(\varOmega (D)\) gives information on the realizability, number of components, chords, loops, pendant edges, faces, bridges, connectedness, cyclicness, etc. of the realizations of D and is shown to have several applications in graph theory. In this paper, we define Lucas graphs as graphs having degree sequence consisting of n consecutive Lucas numbers and by using \(\varOmega \) and its properties, we obtain a characterization of these graphs. We state the necessary and sufficient conditions for the realizability of a given set D consisting of n successive Lucas numbers for every n and also list all possible realizations called Lucas graphs for \(1 \le n \le 4\) and afterwards give the general result for \(n \ge 5\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)

    Book  Google Scholar 

  2. Delen, S., Cangul, I.N.: A new graph invariant. Turk. J. Anal. Number Theory 6(1), 30–33 (2018)

    Article  MathSciNet  Google Scholar 

  3. Delen, S., Cangul, I.N.: Extremal problems on components and loops in graphs. Acta Math. Sinica Eng. Ser. 35(2), 161–171 (2019)

    Article  MathSciNet  Google Scholar 

  4. Delen, S., Togan, M., Yurttas, A., Ana, U., Cangul, I.N.: The effect of edge and vertex deletion on omega invariant. Appl. Anal. Discrete Math. 14, 1–11 (2020)

    Article  MathSciNet  Google Scholar 

  5. Delen, S., Yurttas, A., Togan, M., Cangul, I.N.: Omega invariant of graphs and cyclicness. Appl. Sci. 21, 91–95 (2019)

    MathSciNet  MATH  Google Scholar 

  6. Demirci, M., Akbayrak, O., Ozbek, A., Cangul, I.N.: Fibonacci Graphs (Preprint)

  7. Diestel, R.: Graph Theory. Springer GTM, New York (2010)

    Book  Google Scholar 

  8. Foulds, L.R.: Graph Theory Applications. Springer Universitext, Berlin (1992)

    Book  Google Scholar 

  9. Lucas, E.: Recherces sur Plusieurs Ouvrages de Leonard de Pise et sur Diverses Questions d’Arithmetique Superieure. Imprimerie des Sciences Mathematiques et Physiques, Rome 10(129–193), 239–293 (1877)

    Google Scholar 

  10. Sanli, U., Celik, F., Delen, S., Cangul, I.N.: Connectedness Criteria for Graphs by Means of Omega Invariant. FILOMAT 34 (2020) (Preprint)

  11. Wallis, W.D.: A Beginner’s Guide to Graph Theory. Birkhauser, Boston (2007)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Bursa Uludag University, Gorukle, Bursa, 16059, Turkey

    Musa Demirci, Aydin Ozbek, Osman Akbayrak & Ismail Naci Cangul

Authors
  1. Musa Demirci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aydin Ozbek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Osman Akbayrak
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ismail Naci Cangul
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Musa Demirci.

Ethics declarations

Conflicts of interest

There is no conflict of interest between the authors or with anybody else.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Demirci, M., Ozbek, A., Akbayrak, O. et al. Lucas graphs. J. Appl. Math. Comput. 65, 93–106 (2021). https://doi.org/10.1007/s12190-020-01382-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-020-01382-z

Keywords

Mathematics Subject Classification

Search

Navigation