Realizability ofp-point graphs with prescribed minimum degree, maximum degree, and line connectivity
Authors:
- 1 December 1980
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 4 (4) , 363-370
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Generalization of Line Connectivity and Optimally Invulnerable GraphsSIAM Journal on Applied Mathematics, 1978
- Line removal algorithms for graphs and their degree listsIEEE Transactions on Circuits and Systems, 1976
- On minimum multigraphs with prescribed lower bounds on local line connectivitiesIEEE Transactions on Circuits and Systems, 1976
- Graphs with given connectivity and independence number or networks with given measures of vulnerability and survivabilityIEEE Transactions on Circuit Theory, 1973
- A general class of invulnerable graphsNetworks, 1972
- Lower bounds on the vulnerability of a graphNetworks, 1972
- On the Invulnerability of the Regular Complete k-Partite GraphsSIAM Journal on Applied Mathematics, 1971
- On the Minimum m Degree Vulnerability CriterionIEEE Transactions on Circuit Theory, 1971
- On graphs of invulnerable communication netsIEEE Transactions on Circuit Theory, 1970
- A Graph-Theoretic Approach to a Communications ProblemSIAM Journal on Applied Mathematics, 1966