Abstract
We consider upper bound graphs with respect to operations on graphs, for example, the sum, the Cartesian product, the corona and the middle graphs of graphs, etc. According to the characterization of double bound graphs, we deal with characterizations of double bound graphs obtained by graph operations. For example, The Cartesian product G × H of two graphs G and H is a DB-graph if and only if both G and H are bipartite graphs, the corona G º H of two graphs G and H is a DB-graph if and only if G is a bipartite graph and H is a UB-graph, and the middle graph M(G) of a graph G is a DB-graph if and only if G is an even cycle or a path, etc.
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.
