Abstract
The relationship between Kirchhoff graphs and equitable edge partitions of their corresponding digraphs is discussed. It is shown that if the natural edge partition for the associated digraph to a vector graph is equitable and the quotient matrix based on this partition is symmetric, then the vector graph is Kirchhoff. The converse is not true: many Kirchhoff graphs have natural edge partitions that are not equitable. In addition, it is shown that for a digraph with an equitable edge partition, the partition is uniform if and only if the quotient matrix is symmetric. Hence every uniform equitable edge partition of a digraph is a Kirchhoff partition and can generate a Kirchhoff graph.
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.
