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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Behzad and G. Chartrand, Total graphs and traversability, Proc. Edinburgh Math. Soc., 15 (1966)117–120.
D. Diny, The double bound graph of a partially ordered set, Journal of Combinatorics, Infomation & System Sciences, 10(1985),52–56.
H. Era, K. Ogawa, and M. Tsuchiya, On upper bound graphs with respect to unary operations on graphs, (preprint).
H. Era, K. Ogawa, and M. Tsuchiya, On upper bound graphs with respect to operations on graphs, Theoretical Computer Science, 235(2)(2000),219–223.
H. Era and M. Tsuchiya, On upper bound graphs whose complements are also upper bound graphs, Discrete Mathematics, 197(1998),103–109.
T. Hamada and I. Yoshimura, Traversability and connectivity of the middle graph of a graph, Discrete Mathematics, 14(1976)247–255.
F. Harary, Graph Theory, (Addison-Wesley, 1969).
S.-I. Iwai, K. Ogawa and M. Tsuchiya, A note on construction of double bound graphs, (preprint).
F.R. McMorris and T. Zaslavsky, Bound graphs of a partially ordered set, Journal of Combinatorics, Infomation & System Sciences, 7(1982),134–138.
K. Ogawa and M. Tsuchiya, On upper bound graphs with respect to line graphs, Southeast Asian Bulletin of Mathematics, 23(1999),265–269.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwai, Si., Ogawa, K., Tsuchiya, M. (2001). On double bound graphs with respect to graph operations. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 2000. Lecture Notes in Computer Science, vol 2098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47738-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-47738-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42306-5
Online ISBN: 978-3-540-47738-9
eBook Packages: Springer Book Archive