On the k-matchings of the complements of bicyclic graphs
| Autor: | Hong-Hai Li, Yi-Ping Liang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
010102 general mathematics
Bicyclic graphs 0102 computer and information sciences 01 natural sciences Graph Combinatorics TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 010201 computation theory & mathematics ComputingMethodologies_DOCUMENTANDTEXTPROCESSING Discrete Mathematics and Combinatorics Pairwise comparison 0101 mathematics ComputingMilieux_MISCELLANEOUS MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Discrete Mathematics, Algorithms and Applications. 10:1850016 |
| ISSN: | 1793-8317 1793-8309 |
| DOI: | 10.1142/s1793830918500167 |
| Popis: | A matching of a graph [Formula: see text] is a set of pairwise nonadjacent edges of [Formula: see text], and a [Formula: see text]-matching is a matching consisting of [Formula: see text] edges. In this paper, we characterize the bicyclic graphs whose complements have the extremal number of [Formula: see text]-matchings for all [Formula: see text]. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|