Abstract
Being motivated in terms of mathematical concepts from the theory of electrical networks, Klein and Ivanciuc introduced and studied a new graph-theoretic cyclicity index—the global cyclicity index (D.J. Klein, O. Ivanciuc, Graph cyclicity, excess conductance, and resistance deficit, J. Math. Chem. 30 (2001) 271–287). In this paper, by utilizing techniques from graph theory, electrical network theory and real analysis, we obtain some further results on this new cyclicity measure, including the strictly monotone increasing property, some lower and upper bounds, and some Nordhaus–Gaddum-type results. In particular, we establish a relationship between the global cyclicity index C(G) and the cyclomatic number μ(G) of a connected graph G with n vertices and m edges: mn−1μ(G)≤C(G)≤n2μ(G).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
