Results 121 to 130 of about 3,632 (158)
Counting the number of matchings in chordal and chordal bipartite graph classes
Counting the number of matchings in chordal and chordal bipartite graph classesidentifier:oai:t2r2.star.titech.ac.jp ...
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Perfect Elimination and Chordal Bipartite Graphs
Journal of Graph Theory, 1978AbstractWe define two types of bipartite graphs, chordal bipartite graphs and perfect elimination bipartite graphs, and prove theorems analogous to those of Dirac and Rose for chordal graphs (rigid circuit graphs, triangulated graphs). Our results are applicable to Gaussian elimination on sparse matrices where a sequence of pivots preserving zeros is ...
Golumbic, Martin Charles +1 more
openaire +1 more source
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs
International Journal of Foundations of Computer Science, 2021A set [Formula: see text] of a graph [Formula: see text] is called a connected power dominating set of [Formula: see text] if [Formula: see text], the subgraph induced by [Formula: see text], is connected and every vertex in the graph can be observed from [Formula: see text], following the two observation rules for power system monitoring: Rule ...
Pooja Goyal, B. S. Panda
openaire +2 more sources
Chordal bipartite graphs and crowns
Order, 1985First, the author proves that a bipartite graph is chordal if and only if it has an elimination scheme. Then he provides a polynomial time algorithm for recognizing whether an ordered set is cycle-free.
openaire +2 more sources
Domination in convex and chordal bipartite graphs
Information Processing Letters, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Damaschke, Peter +2 more
openaire +1 more source