Back to Search
Start Over
MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS.
- Source :
-
International Journal of Foundations of Computer Science . Dec2008, Vol. 19 Issue 6, p1413-1437. 25p. 13 Diagrams. - Publication Year :
- 2008
-
Abstract
- The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number for the alternating group graphs, Cayley graphs generated by 2-trees and the (n,k)-arrangement graphs. Moreover, we classify all the optimal solutions. [ABSTRACT FROM AUTHOR]
- Subjects :
- *RESEARCH
*GRAPH theory
*COMPUTER science
*TECHNOLOGY
*COMPUTER programming
Subjects
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 19
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 35976678
- Full Text :
- https://doi.org/10.1142/S0129054108006364