Zobrazit v EDS

Constructions of connected graphs with a given matchable ratio

Uloženo v:

Podrobná bibliografie
Název:	Constructions of connected graphs with a given matchable ratio
Autoři:	Gargano, Michael L., Quintas, L. V.
Informace o vydavateli:	Institute of Combinatorics and its Applications, Boca Raton, FL
Témata:	Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), perfect matching
Popis:	An edge of a graph \(G\) is called matchable if it belongs to a perfect matching of \(G\). Given a positive rational number \(a/b\leq 1\), the authors determine families of connected graphs such that the ratio of the number of matchable edges to the total number of edges is \(a/b\).
Druh dokumentu:	Article
Popis souboru:	application/xml
Přístupová URL adresa:	https://zbmath.org/2226732
Přístupové číslo:	edsair.c2b0b933574d..57478a7751a7b0e937f82ec3542ae76c
Databáze:	OpenAIRE

Popis
Abstrakt:	An edge of a graph \(G\) is called matchable if it belongs to a perfect matching of \(G\). Given a positive rational number \(a/b\leq 1\), the authors determine families of connected graphs such that the ratio of the number of matchable edges to the total number of edges is \(a/b\).