Further results on the largest matching root of unicyclic graphs
From MaRDI portal
Publication:512547
DOI10.1016/J.DAM.2016.12.022zbMath1434.05076OpenAlexW2574080925MaRDI QIDQ512547
Yanbo Zhang, Ivan Gutman, Qiang Guo, Li-Hua Feng, Wei-jun Liu
Publication date: 27 February 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.12.022
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
The extremal permanental sum for a quasi-tree graph ⋮ On the largest matching roots of graphs with a given number of pendent vertices ⋮ Analyzing lattice networks through substructures ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs ⋮ Vertex-based and edge-based centroids of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with few matching roots
- Bounds on the moduli of polynomial zeros
- Applications of the Kelmans transformation: extremality of the threshold graphs
- The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies
- The matching energy of a graph
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- Bounds on the largest root of the matching polynomial
- An introduction to matching polynomials
- Problems in algebraic combinatorics
- Graphs with six distinct matching roots
- The matching energy of random graphs
- The largest matching root of unicyclic graphs
- Graph Energy
- On the theory of the matching polynomial
- On graphs with randomly deleted edges
- The Maximal Matching Energy of Tricyclic Graphs
This page was built for publication: Further results on the largest matching root of unicyclic graphs
