on the number of cliques and cycles in graphs
We give a new recursive method to compute the number of cliques and cycles of a graph. This method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the adjacency matrix of the graph. In particular, le...
Main Authors: | Mojgan Emami, Masoud Ariannejad |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2013-06-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=2872&_ob=183b76bba4970596525b994ca1ef4997&fileName=full_text.pdf. |
Similar Items
-
Clique roots of K4-free chordal graphs
by: Hossein Teimoori Faal
Published: (2019-04-01) -
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
by: Valentin E. Brimkov, et al.
Published: (2024-01-01) -
Spectral Applications of Vertex-Clique Incidence Matrices Associated with a Graph
by: Shaun Fallat, et al.
Published: (2023-08-01) -
The Clique Number and The Chromatics Number Of The Coprime Graph for The Generalized Quarternion Group
by: Marena Rahayu Gayatri, et al.
Published: (2023-04-01) -
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
by: Chuan-Min Lee
Published: (2021-01-01)