On the k-matchings of the complements of bicyclic graphs
From MaRDI portal
Publication:4634518
DOI10.1142/S1793830918500167zbMath1383.05261OpenAlexW2782391063MaRDI QIDQ4634518
Publication date: 10 April 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830918500167
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The maximum matching energy of bicyclic graphs with even girth
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- The matching energy of a graph
- Extremal matching energy of complements of trees
- The matching energy of graphs with given parameters
- The matching energy of graphs with given edge connectivity
- On the ordering of graphs with respect to their matching numbers
- Recent results in the theory of graph spectra
- On ordering of complements of graphs with respect to matching numbers
- Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
- The matching energy of random graphs
- Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets
- On the ordering of a class of graphs with respect to their matching numbers
- Graph Energy
- The Maximal Matching Energy of Tricyclic Graphs
- Extremal hexagonal chains concerning \(k\)-matchings and \(k\)-independent sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item