The maximum matching energy of bicyclic graphs with even girth
From MaRDI portal
Publication:277654
DOI10.1016/J.DAM.2016.01.020zbMath1335.05112OpenAlexW2288045463MaRDI QIDQ277654
Shengjin Ji, Gang Ma, Qiuju Bian, Xia Li
Publication date: 2 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.020
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth ⋮ Extremal bipartite graphs of given connectivity with respect to matching energy ⋮ On the k-matchings of the complements of bicyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum matching energy of bicyclic graphs with given girth
- On the maximal energy tree with two maximum degree vertices
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- On the tree with diameter 4 and maximal energy
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- The matching energy of a graph
- The matching energy of graphs with given parameters
- On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3
- The matching energy of random graphs
- On the signless Laplacian coefficients of unicyclic graphs
- Graph Energy
- On a conjecture about tricyclic graphs with maximal energy
- The Maximal Matching Energy of Tricyclic Graphs
- The matching energy of graphs with given edge connectivity
This page was built for publication: The maximum matching energy of bicyclic graphs with even girth