The matching energy of random graphs
From MaRDI portal
Publication:2354718
DOI10.1016/j.dam.2015.04.022zbMath1317.05148arXiv1412.6909OpenAlexW2962910333MaRDI QIDQ2354718
Hui-shu Lian, Xiao-Lin Chen, Xue Liang Li
Publication date: 24 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6909
Graph polynomials (05C31) Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The maximum matching energy of bicyclic graphs with even girth, Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth, The matching energy of graphs with given edge connectivity, Extremal bipartite graphs of given connectivity with respect to matching energy, Statistical Matching Theory, On ordering of complements of graphs with respect to matching numbers, On the k-matchings of the complements of bicyclic graphs, The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies, Further results on the largest matching root of unicyclic graphs, Chromatic roots and limits of dense graphs, Two classes of topological indices of phenylene molecule graphs, Extremal matching energy and the largest matching root of complete multipartite graphs
Cites Work
- The skew energy of random oriented graphs
- The energy of random graphs
- The matching energy of a graph
- The matching energy of graphs with given parameters
- On the distribution of the roots of certain symmetric matrices
- The energy of graphs and matrices
- The Laplacian energy of random graphs
- An introduction to matching polynomials
- Theory of monomer-dimer systems
- Graph Energy
- An Introduction to Random Matrices
- On the theory of the matching polynomial
- Matchings and walks in graphs
- The Maximal Matching Energy of Tricyclic Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item