[PDF] Top 20 Centers and medians of distance-hereditary graphs

... Department of Mathematics, National Taiwan University, Taipei 106, Taiwan Received 22 August 2000; received in revised form 8 May 2002; accepted 28 May 2002 Abstract A graph is distance-hereditary ... See full document

... dian and center objectives for location of switching ...in graphs. For exam- ple, each vertex in a graph G represents a customer and a store can be created in any vertex of ...store ... See full document

... problem and its variants have been extensively studied in the ...in distance-hereditary ...in distance-hereditary graphs by a labeling ... See full document

... Some well-known results of this kind are polynomial algorithms for the weighted domination and the weighted independent domination problems in strongly chordal grap[r] ... See full document

... on distance-hereditary graphs ...cycle and 2HP problems on distance-hereditary graphs can be solved in O(n 3 ) ...) and O(n 5 ) time algorithms for 1HP and ... See full document

... on distance-hereditary graphs utilize techniques discovered from the properties of the problems and graphs, which we feel are inherently ...paradigm, and thus a good ... See full document

... 4 and 5, to compute the minimum connected ␥-dominating set of G, we may choose any homogeneous set of current graph to reduce in each iteration of the ...leaves of the equiva- ... See full document

... area of a country is divided into cells. Cells are normally thought of as hexagonal ...points of each hexagonal grid. Motivated by the placement of transmitters for cellular telephones, Chang, ... See full document

... is distance-hereditary if the distance between any two vertices in a connected in- duced subgraph is the same as in the original ...k-domination and the weighted k-dominatingclique problems in ... See full document

... clique-transversal and maximum clique-independent sets of a distance-hereditary graph have the same car- dinality, and the clique-transversal set problem can be solved in O(n + m) time ... See full document

... In this papel; we present eficient parallel algorithms forjinding a minimum weighted connected dominating set, a minimum weighted Steiner tree for a distance-hereditary graph whi[r] ... See full document

... Finally, by using the main theorem in Section 2, we give a necessary and sufficient condition for a biconnected chordal graph of diameter 2 and radius 1 to be the center of s[r] ... See full document

... exists and is a rational number. This result was also proven by Rabinowitz and Proulx [30] and Cantor and Gordon [1] by different ...notion of distance graphs originated ... See full document

... numbers and fractional chromatic numbers of distance graphs G (Z, D) for various distance sets ...sets of size two, for some special D sets of size three, for D = {1, 2, ... See full document

... Keywords: Distance; Labeling; Degree; Tree; Star; Algorithm; Neighbor ...problem of vertex labeling with a condition at distance two, proposed by Griggs and Roberts [16], arose from a ... See full document

... D of positive integers, the distance graph G (Z, D) has all integers as vertices, and two vertices are adjacent if and only if their difference is in D; that is, the vertex set is Z and ... See full document

... Keywords: distance graph, vertex, coloring, chromatic number ...number of colors needed to color all points of the Euclidean plane such that no two points of distance one have the same ... See full document

... partially distance-regular graphs and partially walk- regular graphs as generalizations of distance-regular graphs and walk- regular graphs ...partially ... See full document

... set of G if every vertex v  V satisfies w D  v  3 where w D  v  3  v   D 2 N 1  v   D N 2  v  ...D of a D 3,2,1 -dominating set of G , denoted as  3,2,1   G , is called the D ... See full document

... halved graphs of a bipartite distance- regular graph are ...characterization of a connected bipartite weighted 2-punctually distance-regular graph whose halved graphs are ...is ... See full document