Abstract

AbstractThe middle graph of a graph G=( V, E) is the graph M(G) = (V∪E, E′), in which two vertices u, v are adjacent if either M is a vertex in V and v is an edge in E containing u, or u and v are edges in E having a vertex in common. Middle graphs have been characterized in terms of line graphs by Hamada and Yoshimura [7], who also investigated their traversability and connectivity properties. In this paper another characterization of middle graphs is presented, in which they are viewed as a class of intersection (representative) graphs of hereditary hypergraphs. Graph theoretic parameters associated with the concepts of vertex independence, dominance, and irredundance for middle graphs are discussed, and equalities relating the chromatic number of a graph to these parameters are obtained.

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 call

Disclaimer: 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.