A Study on Metric Properties of Graphs: Hinge Vertices and Graph Powers
博士 === 國立臺灣科技大學 === 資訊管理系 === 88 === Abstract In this dissertation, two topics related to the metric properties of graphs are considered. One is the hinge vertex and the other is the graph power. The first part of this dissertation looks at the algorithmic complexities of the p...
Main Authors: | Ting-Yem Ho, 何定燕 |
---|---|
Other Authors: | Yue-Li Wang |
Format: | Others |
Language: | en_US |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/07312724064602441825 |
Similar Items
-
A Certifying Algorithm for Finding Hinge Vertices of Strongly Chordal Graphs
by: Guei-Lin Chiu, et al.
Published: (2008) -
A study on communication graphs
by: 何定燕
Published: (1992) -
A PARALLEL ALORITHM FOR FINDING ALL HINGE-VERTICES OF A PERMUTATION GRAPH
by: Ruan, Ming-Can, et al.
Published: (1995) -
Reducing vertices in property graphs.
by: Dominik Tomaszuk, et al.
Published: (2018-01-01) -
Computing Metric Dimension of Power of Total Graph
by: Sehar Nawaz, et al.
Published: (2021-01-01)