International Journal of Computational and Applied Mathematics & Computer Science
E-ISSN: 2769-2477
Volume 2, 2022
Domination, Independence and Fibonacci Numbers in Graphs Containing Disjoint Cycles
Authors: ,
Abstract: 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.
Search Articles
Pages: 65-68
DOI: 10.37394/232028.2022.2.12