EUVIMEDEUVIMED entdecken
Crossref

Domination, Independence and Fibonacci Numbers in Graphs Containing Disjoint Cycles

Omprakash Sikhwal, Ashish Rastogi

International Journal of Computational and Applied Mathematics & Computer Science · 2022

DOI: 10.37394/232028.2022.2.12 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Computational and Applied Mathematics & Computer Science, 2022. Verfasst von Omprakash Sikhwal und 1 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph theory is a delightful playground for the exploration of proof techniques in discrete mathematics and its results have applications in many areas of the computing, social, and natural sciences. The fastest growing area within graph theory is the study of domination and Independence numbers. Domination number is the cardinality of a minimum dominating set of a graph. Independence number is the maximal cardinality of an independent set of vertices of a graph. The concept of Fibonacci numbers of graphs was first introduced by Prodinger and Tichy in 1982. The Fibonacci numbers of a graph is the number of independent vertex subsets. In this paper, introduce the identities of domination, independence and Fibonacci numbers of graphs containing vertex-disjoint cycles and edge-disjoint cycles.

Zitieren

APA

Sikhwal, O., & Rastogi, A. (2022). Domination, Independence and Fibonacci Numbers in Graphs Containing Disjoint Cycles. International Journal of Computational and Applied Mathematics & Computer Science. https://doi.org/10.37394/232028.2022.2.12

Vancouver

Sikhwal O, Rastogi A. Domination, Independence and Fibonacci Numbers in Graphs Containing Disjoint Cycles. International Journal of Computational and Applied Mathematics & Computer Science. 2022. doi:10.37394/232028.2022.2.12

BibTeX
@article{Sikhwal2022,
  author = {Sikhwal, Omprakash and Rastogi, Ashish},
  title = {Domination, Independence and Fibonacci Numbers in Graphs Containing Disjoint Cycles},
  journal = {International Journal of Computational and Applied Mathematics & Computer Science},
  year = {2022},
  doi = {10.37394/232028.2022.2.12}
}
Kostenlos starten →