Abstract.
Let G be a (V,E) graph of order p≥2. The double vertex graph U 2 (G) is the graph whose vertex set consists of all 2-subsets of V such that two distinct vertices {x,y} and {u,v} are adjacent if and only if |{x,y}∩{u,v}|=1 and if x=u, then y and v are adjacent in G. For this class of graphs we discuss the regularity, eulerian, hamiltonian, and bipartite properties of these graphs. A generalization of this concept is n-tuple vertex graphs, defined in a manner similar to double vertex graphs. We also review several recent results for n-tuple vertex graphs.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October, 2001 Final version received: September 20, 2002
Dedicated to Frank Harary on the occasion of his Eightieth Birthday and the Manila International Conference held in his honor
Rights and permissions
About this article
Cite this article
Alavi, Y., Lick, D. & Liu, J. Survey of Double Vertex Graphs. Graphs Comb 18, 709–715 (2002). https://doi.org/10.1007/s003730200055
Issue Date:
DOI: https://doi.org/10.1007/s003730200055