Title :
Universal graphs for 2-paths
Author :
Ueno, Shuichi ; Kitakaku, Tomohiro ; Kajitani, Yoji
Author_Institution :
Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan
Abstract :
Given a family of graphs, a graph is said to be universal for the family if it contains every graph of the family as a subgraph. 2-paths are a special kind of outerplanar graph. It is shown that the minimum number of edges in a universal graph for the family of all 2-paths on n vertices is Θ(n log n). The authors consider finite undirected graphs without loops or multiple edges
Keywords :
graph theory; 2-paths; edges; finite undirected graphs; minimum number; outerplanar graph; subgraph; universal graph; vertices; Circuit synthesis; Parallel processing; Particle separators; Tree graphs; Upper bound;
Conference_Titel :
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN :
0-7803-0050-5
DOI :
10.1109/ISCAS.1991.176570
