The number of n-cycles in a graph

Autor:	Gordon G. Cash
Rok vydání:	2007
Předmět:	Applied Mathematics Voltage graph Distance-regular graph law.invention Combinatorics Computational Mathematics Graph energy law Graph power Line graph Regular graph Adjacency matrix Graph factorization MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Applied Mathematics and Computation. 184:1080-1083
ISSN:	0096-3003
DOI:	10.1016/j.amc.2006.06.085
Popis:	Recently, Chang and Fu [Y.C. Chang, H.L. Fu, The number of 6-cycles in a graph, Bull. Inst. Combin. Appl. 39 (2003) 27–30] derived an exact expression, based on powers of the adjacency matrix, for the number of 6-cycles in a graph. Here, I demonstrate a method for obtaining the number of n-cycles in a graph from the immanants of the adjacency matrix. The method is applicable to cycles of all sizes and to sets of disjoint cycles of any sizes, and the cycles in the set need not be the same size.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2d526339f430ac439496bc08180683e8 https://doi.org/10.1016/j.amc.2006.06.085 Zobrazit plný text záznamu Full Text from ScienceDirect