The recognition of geodetically connected graphs

Jou Ming Changa, Chin Wen Ho

研究成果: 雜誌貢獻期刊論文同行評審

9 引文 斯高帕斯(Scopus)

摘要

Let G = (V, E) be a graph with vertex set V of size n and edge set E of size m. A vertex v ∈ V is called a hinge vertex if the distance of any two vertices becomes longer after v is removed. A graph without hinge vertex is called a hinge-free graph. In general, a graph G is k-geodetically connected or k-GC for short if G can tolerate any k - 1 vertices failures without increasing the distance among all the remaining vertices. In this paper, we show that recognizing a graph G to be k-GC for the largest value of k can be solved in O(nm) time. In addition, more efficient algorithms for recognizing the k-GC property on some special graphs are presented. These include the O(n + m) time algorithms on strongly chordal graphs (if a strong elimination ordering is given), ptolemaic graphs, and interval graphs, and an O(n2) time algorithm on undirected path graphs (if a characteristic tree model is given). Moreover, we show that if the input graph G is not hinge-free then finding all hinge vertices of G can be solved in the same time complexity on the above classes of graphs.

原文???core.languages.en_GB???
頁(從 - 到)81-88
頁數8
期刊Information Processing Letters
65
發行號2
DOIs
出版狀態已出版 - 1998

指紋

深入研究「The recognition of geodetically connected graphs」主題。共同形成了獨特的指紋。

引用此