THE NUMBER OF DISTINCT 4-CYCLES AND 2-MATCHINGS OF SOME ZERO-DIVISOR GRAPHS

DOI10.1142/9789814317610_0005MaRDI QIDQ4922673zbMATH OpenOpenAlexFDO

Authors Mitsuo Kanemitsu

Publication date 3 June 2013

Published in Automata, Formal Languages and Algebraic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814317610_0005

zbMATH Keywords

characteristic polynomialzero-divisor graphring of integers

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Paths and cycles (05C38) General commutative ring theory (13A99)

Recommendations

• Matchings and total domination subdivision number in graphs with few induced 4-cycles
• The number of $4$-cycles and the cyclomatic number of a finite simple graph
• scientific article; zbMATH DE number 5656434
• The number of 4-cycles in a graph
• The zero forcing number of graphs with the matching number and the cyclomatic number
• The number of 4-cycles in triangle-free oriented graphs
• The number of perfect matchings in four types of particular graphs
• scientific article; zbMATH DE number 6178330
• The cycle in 2-connected \([4,2]\)-graphs
• Cycles of length 0 modulo 4 in graphs

Cited in

(3)

• Beck's graphs associated with \(\mathbb Z_n\) and their characteristic polynomials
• Matching of zero divisor graph over commutative ring \(\mathbb{Z}_n\)
• The number of $4$-cycles and the cyclomatic number of a finite simple graph

This page was built for publication: THE NUMBER OF DISTINCT 4-CYCLES AND 2-MATCHINGS OF SOME ZERO-DIVISOR GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922673)