Back to Search
Start Over
STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS.
- Source :
-
Journal of Interconnection Networks . Dec2011, Vol. 12 Issue 4, p277-298. 22p. 3 Diagrams. - Publication Year :
- 2011
-
Abstract
- The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem and has recently been introduced by Park and Ihm.15 In this paper, we examine properties of strong matching preclusion for alternating group graphs, by finding their strong matching preclusion numbers and categorizing all optimal solutions. More importantly, we prove a general result on taking a Cartesian product of a graph with K2 (an edge) to obtain the corresponding results for split-stars. [ABSTRACT FROM AUTHOR]
- Subjects :
- *CHARTS, diagrams, etc.
*GRAPHIC methods
*PAPER
*PRECLUSION (Law)
*FIBERS
Subjects
Details
- Language :
- English
- ISSN :
- 02192659
- Volume :
- 12
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Journal of Interconnection Networks
- Publication Type :
- Academic Journal
- Accession number :
- 77387590
- Full Text :
- https://doi.org/10.1142/S0219265911003003