Matching preclusion for direct product of regular graphs

Let G be a graph with an even number of vertices. The matching preclusion number of G , denoted by m p ( G ) , is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. G is maximally matched if m p ( G ) is equal to the minimum degree of G and is super mat...
Ausführliche Beschreibung

Gespeichert in:
Autor*in:

Lin, Ruizhi [verfasserIn]

Zhang, Heping

Zhao, Weisheng

Format:

E-Artikel

Sprache:

Englisch

Erschienen:

2020transfer abstract

Schlagwörter:

Direct product

Strong product

Matching preclusion

Super matched

Maximally matched

Regular graph

Umfang:

10

Übergeordnetes Werk:

Enthalten in: Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures - Miguel, F.L. ELSEVIER, 2013transfer abstract, [S.l.]

Übergeordnetes Werk:

volume:277 ; year:2020 ; day:30 ; month:04 ; pages:221-230 ; extent:10

Links:

Volltext

DOI / URN:

10.1016/j.dam.2019.08.016

Katalog-ID:

ELV049755749

Nicht das Richtige dabei?

Schreiben Sie uns!