2019
DOI: 10.11648/j.ajam.20190702.13
|View full text |Cite
|
Sign up to set email alerts
|

Strong Matching Preclusion for Augmented Butterfly Networks

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. The strong matching preclusion number (or simply, SMP number) smp(G) of a graph G is the minimum number of vertices and/or 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 been introduced by Park and Ihm. Butterfly Networks… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Augumented butterfly network of dimension n, denoted by ABF (n), is a butterfly network of dimension n with an edge along the antipodal vertices in every cycle of BF (n). Augumented butterfly network hold onto most of the properties of BF (n) [24]. By determining the topological indices of Augumented butterfly, we can analyse some of its properties.…”
Section: Introductionmentioning
confidence: 99%
“…Augumented butterfly network of dimension n, denoted by ABF (n), is a butterfly network of dimension n with an edge along the antipodal vertices in every cycle of BF (n). Augumented butterfly network hold onto most of the properties of BF (n) [24]. By determining the topological indices of Augumented butterfly, we can analyse some of its properties.…”
Section: Introductionmentioning
confidence: 99%