Name
Abstract | ||
|---|---|---|
Let G = (V; E) be a graph with vertex set V of size n and edge set E of size m. A vertex v 2 V is calleda hinge vertex if the distance of any two vertices becomes longer after v is removed. A graph without hingevertex is called a hinge-free graph. In general, a graph G is k-geodetically connected or k-GC for short if Gcan tolerate any k \Gamma 1 vertices failures without increasing the distance among all the remaining vertices. In thispaper, we show that recognizing a graph G to be k-GC for ... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0020-0190(97)00201-9 | Inf. Process. Lett. |
Keywords | Field | DocType |
geodetically connected graph,connected graph | Discrete mathematics,Combinatorics,Indifference graph,Bound graph,Graph power,Vertex (graph theory),Chordal graph,Cycle graph,Neighbourhood (graph theory),Pathwidth,Mathematics | Journal |
Volume | Issue | ISSN |
65 | 2 | 0020-0190 |
Citations | PageRank | References |
5 | 0.65 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jou-Ming Chang | 1 | 546 | 50.92 |
| Chin-Wen Ho | 2 | 573 | 39.27 |