𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

✍ Scribed by Panda, B. S.; Pradhan, D.

Book ID
118004902
Publisher
Springer US
Year
2012
Tongue
English
Weight
571 KB
Volume
26
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Perfect Elimination and Chordal Bipartit
Perfect Elimination and Chordal Bipartite Graphs
✍ Martin Charles Golumbic; Clinton F. Goss πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 348 KB

## Abstract We 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 spars