Results 151 to 160 of about 3,915 (163)
Some of the next articles are maybe not open access.
Odd twists on strongly chordal graphs
Discrete Mathematics, Algorithms and Applications, 2019Strongly chordal graphs can be characterized as chordal graphs in which every even cycle of length at least [Formula: see text] has an odd chord (a chord whose endpoints are an odd distance apart in the cycle subgraph). Define “oddly chordal graphs” to be chordal graphs in which every odd cycle of length at least [Formula: see text] has an odd chord ...
openaire +1 more source
The w‐median of a connected strongly chordal graph
Journal of Graph Theory, 1994AbstractSuppose G = (V, E) is a graph in which every vertex x has a non‐negative real number w(x) as its weight. The w‐distance sum of a vertex y is DG, w(y) = σx≅v d(y, x)w(x). The w‐median of G is the set of all vertices y with minimum w‐distance sum DG,w(y).
Lee, Hai-Yen, Chang, Gerard J.
openaire +2 more sources
Steiner trees, connected domination and strongly chordal graphs
Networks, 1985AbstractWe consider Steiner tree problems and connected dominating set problems for several classes of graphs. We give a polynomial algorithm and a min‐max theorem for the cardinality Steiner problem in strongly chordal graphs and a polynomial algorithm for the weighted connected dominating set problem in series‐parallel graphs.
White, Kevin +2 more
openaire +1 more source
Broadcast domination and multipacking in strongly chordal graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brewster, Richard C. +2 more
openaire +1 more source
A good characterization of squares of strongly chordal split graphs
Information Processing Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Le, Van Bang, Nguyen, Ngoc Tuy
openaire +2 more sources
Characterizing s-strongly chordal bipartite graphs
Utilitas Mathematica<p>The strongly chordal graph literature has recently expanded to include the sequentially smaller classes of <span class="math inline">\(s\)</span>-strongly chordal graphs for <span class="math inline">\(s = 1, 2, 3,\ldots\)</span> (and the limiting class of majorly chordal graphs). These stronger classes preserve — while
openaire +1 more source
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
2002Chordal bipartite graphs are introduced to analyze nonsymmetric matrices, and form a large class of perfect graphs. There are several problems, which can be solved efficiently on the class using the characterization by the doubly lexical ordering ofthe bipartite adjacency matrix.
openaire +1 more source
On Generating Strong Elimination Orderings of Strongly Chordal Graphs
1998We present a conceptually simple algorithm to generate an ordering of the vertices of an undirected graph. The ordering generated turns out to be a strong elimination ordering if and only if the given graph is a strongly chordal graph. This algorithm makes use of maximum cardinality search and lexicographic breadth first search algorithms which are ...
N. Kalyana Rama Prasad +1 more
openaire +1 more source
Strong clique trees, neighborhood trees, and strongly chordal graphs
Journal of Graph Theory, 2000A graph is a strongly chordal graph, if it is chordal and every cycle of even length at least six has a chord that divides the cycle into two odd-length paths. Whereas maximal complete subgraphs and clique trees are central objects in the theory of chordal grahps, a simple notion of strong clique trees allows to extend this structure to strongly ...
openaire +2 more sources