Degree distance of unicyclic graphs with given matching number
From MaRDI portal
Publication:2376081
DOI10.1007/s00373-012-1143-5zbMath1267.05107OpenAlexW2030468286MaRDI QIDQ2376081
Aleksandar Ilić, Guihai Yu, Wei-jun Liu, Li-Hua Feng
Publication date: 26 June 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1143-5
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (10)
Note on two generalizations of the Randić index ⋮ On the degree distance of unicyclic graphs with given matching number ⋮ The asymptotic value of energy for matrices with degree-distance-based entries of random graphs ⋮ On Steiner degree distance of trees ⋮ On some degree-and-distance-based graph invariants of trees ⋮ The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies ⋮ Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs ⋮ The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees ⋮ Some extremal results on the connective eccentricity index of graphs ⋮ Further properties on the degree distance of graphs
Uses Software
Cites Work
- Degree distance of unicyclic and bicyclic graphs
- On the degree distance of a graph
- Trees with minimal Laplacian coefficients
- The minimum degree distance of graphs of given order and size
- Properties of connected graphs having minimum degree distance
- Bounds on the largest eigenvalues of trees with a given size of matching
- On the spectral radius of unicyclic graphs with perfect matchings
- Some extremal properties of the degree distance of a graph
- Unicyclic and bicyclic graphs having minimum degree distance
- Wiener index of trees: Theory and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Degree distance of unicyclic graphs with given matching number