Results 1 to 10 of about 54,937 (142)
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2014 Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
Caria Pablo De, McKee Terry A.
doaj +3 more sources
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs [PDF]
Discrete Applied Mathematics, 2005 This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Ryuhei Uehara
exaly +3 more sources
A characterization of strongly chordal graphs
Discrete Mathematics, 1998 In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the ...
Elias Dahlhaus, Mirka Miller
exaly +3 more sources
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science, 2007 Golumbic, Kaplan, and Shamir, in their paper [M.C. Golumbic, H. Kaplan, R. Shamir, Graph sandwich problems, J. Algorithms 19 (1995) 449–473] on graph sandwich problems published in 1995, left the status of sandwich problems for strongly chordal graphs ...
C M H de Figueiredo +2 more
exaly +3 more sources
MathematicsDomination problems are fundamental problems in graph theory with diverse applications in optimization, network design, and computational complexity.
Chuan-Min Lee
doaj +3 more sources
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
Discrete Mathematics, 2007 A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v∈V(G).
Ching-Chi Lin +2 more
exaly +3 more sources
On Strongly Chordal Graphs That Are Not Leaf Powers [PDF]
Lecture Notes in Computer Science, 2017 A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph \(G = (V, E)\) is a leaf power if there exist a tree T on leafset V and a threshold k ...
Manuel Lafond, Lafond Manuel
exaly +2 more sources
Characterizations of strongly chordal graphs
Discrete Mathematics, 1983 In this paper we present several characterizations of the class of strongly chordal graphs. These include a forbidden induced subgraph characterization and two characterizations in terms of totally balanced matrices.
Farber, Martin
core +2 more sources
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Discrete Mathematics, 2003 Robert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the symmetric difference of k−2 triangles. Strongly chordal (and chordal bipartite) graphs can be similarly characterized in terms of the distribution of triangles ...
Terry A Mckee
exaly +2 more sources
Broadcast domination and multipacking in strongly chordal graphs
Discrete Applied Mathematics, 2019 A linear programming algorithm to compute the broadcast domination number and the multipacking number of a strongly chordal graph is described. It runs in time cubic in the number of vertices of the input graph.
Richard C Brewster, Gary Macgillivray
exaly +2 more sources