Name
Abstract | ||
|---|---|---|
. If two non-adjacent vertices of a connected graph that have a common neighbor are identified and the resulting multiple edges
are reduced to simple edges, then we obtain another graph of order one less than that of the original graph. This process
can be repeated until the resulting graph is complete. We say that we have folded the graph onto complete graph. This process
of folding a connected graph G onto a complete graph induces in a very natural way a partition of the vertex-set of G. We denote by F(G) the set of all complete graphs onto which G can be folded. We show here that if p and q are the largest and smallest orders, respectively, of the complete graph in F(W
n
) or F(F
n
), then K
s
is in F(W
n
) or F(F
n
) for each s, q≤s≤p. Lastly, we shall also determine the exact values of p and q. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/s003730200058 | Graphs and Combinatorics |
Keywords | Field | DocType |
connected graph,complete graph | Topology,Discrete mathematics,Combinatorics,Edge-transitive graph,Line graph,Graph power,Null graph,Distance-regular graph,Butterfly graph,Mathematics,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
18 | 4 | 0911-0119 |
Citations | PageRank | References |
1 | 0.41 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Severino V. Gervacio | 1 | 22 | 6.38 |
| Romulo C. Guerrero | 2 | 1 | 0.41 |
| Helen M. Rara | 3 | 1 | 0.41 |