Name
Abstract | ||
|---|---|---|
Let G = (V, E) be a simple undirected graph. N(G) = (V, E N ) is the neighborhood graph of the graph G, if and only if $$E_N = \{\{a,b\}\,|\, a \neq b\,\wedge\,\exists\, x \, \in V: \{x,a\} \in E \, \wedge \, \{x,b\} \in E \}.$$ be the class of all k-edge connected 4-regular graphs with girth of at least g. For several choices of k and g, we determine a set $${\mathcal{O}_{k,g}}$$of graph operations, for which, if G and H are graphs in $${\Phi_{k,g}}$$, G ≠ H, and G contains H as an immersion, then some operation in $${\mathcal{O}_{k,g}}$$can be applied to G to result in a smaller graph G′ in $${\Phi_{k,g}}$$such that, on one hand, G′ is immersed in G, and on the other hand, G′ contains H as an immersion. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s00373-010-0909-x | Graphs and Combinatorics |
Keywords | DocType | Volume |
Neighborhood Graphs,4-regular graph,Structural Properties,graph operation,simple undirected graph,graph G,neighborhood graph,E N,smaller graph | Journal | 26 |
Issue | ISSN | Citations |
3 | 0911-0119 | 2 |
PageRank | References | Authors |
0.43 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guoli Ding | 1 | 444 | 51.58 |
| Jinko Kanno | 2 | 23 | 6.03 |