The inertia and energy gap of a vertex-decorated graph with identically weighted `internal' edges and beyond
In a complicated construction process, the author, starting with an undirected graph, builds up a new graph by replacing vertices by other graphs. He determines what he calls the inertia and the energy gap, depending on varying the weight attached to certain graph arcs, where the inertia refers to graph eigenvalues and the energy gap to certain differences of graph eigenvalues. In the chemical application, the eigenvalues of a molecular quantum chemical graph correspond to energy levels of electrons.
- The inertia and energy of the distance matrix of a connected graph
- Energy and inertia of the eccentricity matrix of coalescence of graphs
- On the extremal energy of integral weighted graphs
- The inertia and energy of distance matrices of complete \(k\)-partite graphs
- On the incidence energy of graphs under three graph decorations.
- Graphs with maximum Laplacian-energy-like invariant and incidence energy
- On the oriented incidence energy and decomposable graphs
- Bounds for the energy of weighted graphs
- The behavior of weighted graph's orbit and its energy
- The Laplacian incidence energy of graphs
- Close-to-zero eigenvalues of the rooted product of graphs
- Eigenvalues of saturated hydrocarbons
- scientific article; zbMATH DE number 3621932 (Why is no real title available?)
- Matching theory
- Matrix Analysis
- The spectrum of the vertex quadrangulation of a 4-regular toroidal graph and beyond
- The truncation of a cage graph
This page was built for publication: The inertia and energy gap of a vertex-decorated graph with identically weighted `internal' edges and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118791)