Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
On Common Subgraphs, Hung Bin Zou
On Common Subgraphs, Hung Bin Zou
Dissertations
A greatest common (induced) subgraph of graphs G(,1) and G(,2) of equal size is a (an induced) common subgraph (without isolated vertices) of G(,1) and G(,2) having maximum size. For a given graph L, a graph G is locally L if the induced subgraph of the neighborhood of each vertex of G is isomorphic to L (L is called a common link). Several topics concerning these concepts are investigated in this dissertation. An historical background to these topics is given in Chapter I.
Chapter II is devoted to the topic on highly connected unique greatest common subgraphs of graphs. We …