The Maximal Matching Energy of Tricyclic Graphs

zbMath1464.05230arXiv1409.2038MaRDI QIDQ5279101

Publication date: 19 July 2017

Full work available at URL: https://arxiv.org/abs/1409.2038

computer search tricyclic graphs maximal number of matchings Coulson-type integral formula of matching energy

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (50)

The maximum matching energy of bicyclic graphs with even girth ⋮ Spectral properties with the difference between topological indices in graphs ⋮ Corrigendum to: ``The minimum matching energy of bicyclic graphs with given girth ⋮ New inequalities for network distance measures by using graph spectra ⋮ Bicyclic oriented graphs with skew-rank 2 or 4 ⋮ Reciprocal complementary distance equienergetic graphs ⋮ Degree-based entropies of networks revisited ⋮ The minimum matching energy of bicyclic graphs with given girth ⋮ On the Sombor characteristic polynomial and Sombor energy of a graph ⋮ Further results on digraphs with completely real Laplacian spectra ⋮ Coulson-type integral formulas for the general energy of a vertex ⋮ Matchings in graphs with a given number of cuts ⋮ Coulson-type integral formulas for the general energy of polynomials with real roots ⋮ Wiener polarity index of dendrimers ⋮ The matching energy of graphs with given edge connectivity ⋮ Extremal bipartite graphs of given connectivity with respect to matching energy ⋮ On the minimal matching energies of unicyclic graphs ⋮ On ordering of complements of graphs with respect to matching numbers ⋮ On edge-rupture degree of graphs ⋮ A polynomial algorithm of edge-neighbor-scattering number of trees ⋮ Ordering of oriented unicyclic graphs by skew energies ⋮ Solutions to unsolved problems on the minimal energies of two classes of trees ⋮ On the k-matchings of the complements of bicyclic graphs ⋮ On spectral radius and energy of extended adjacency matrix of graphs ⋮ Some new lower bounds for energy of 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 ⋮ Bounds for the sum-Balaban index and (revised) Szeged index of regular graphs ⋮ Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices ⋮ Extremal Laplacian energy of threshold graphs ⋮ On energy and Laplacian energy of bipartite graphs ⋮ The general connectivity indices of fluoranthene-type benzenoid systems ⋮ Extremal values of matching energies of one class of graphs ⋮ Hermitian Laplacian matrix and positive of mixed graphs ⋮ Randić energy of specific graphs ⋮ The asymptotic value of the zeroth-order Randić index and sum-connectivity index for trees ⋮ Spectral properties of geometric-arithmetic index ⋮ The extremal values of some topological indices in bipartite graphs with a given matching number ⋮ Energy of matrices ⋮ Further results on the largest matching root of unicyclic graphs ⋮ On the ordering of bicyclic digraphs with respect to energy and iota energy ⋮ On the spectral radius and energy of the weighted adjacency matrix of a graph ⋮ Some topological indices and graph properties ⋮ Extremal matching energy of complements of trees ⋮ Two classes of topological indices of phenylene molecule graphs ⋮ Extremal graphs with respect to matching energy for random six-membered ring spiro chains ⋮ Analyzing lattice networks through substructures ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs ⋮ The Sachs theorem and its application on extended adjacency matrix of graphs ⋮ The matching energy of random graphs

This page was built for publication: The Maximal Matching Energy of Tricyclic Graphs