Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs

@article{Zhao2019ResistanceDG,
  title={Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs},
  author={Jing Zhao and Jia‐Bao Liu and Sakander Hayat},
  journal={Journal of Applied Mathematics and Computing},
  year={2019},
  volume={63},
  pages={1-27}
}
Resistance distance is a novel distance function, also a new intrinsic graph metric, which makes some extensions of ordinary distance. Let $$O_n$$ O n be a linear crossed octagonal graph. Recently, Pan and Li (Int J Quantum Chem 118(24):e25787, 2018) derived the closed formulas for the Kirchhoff index, multiplicative degree-Kirchhoff index and the number of spanning trees of $$H_n$$ H n . They pointed that it is interesting to give the explicit formulas for the Kirchhoff and multiplicative… 

Figures and Tables from this paper

The (multiplicative degree-)Kirchhoff index of graphs derived from the Catersian product of $S_n$ and $K_2$
Recently, Li et al. [Appl. Math. Comput. 382 (2020) 125335] proposed the problem of determining the Kirchhoff index and multiplicative degree-Kirchhoff index of graphs derived from $S_n \times K_2$,
Kirchhoff Indices and Numbers of Spanning Trees of Molecular Graphs Derived from Linear Crossed Polyomino Chain
Abstract Polyomino systems are widely studied in organic chemistry, especially in polycyclic aromatic compounds. Let Qn be a linear crossed polyomino chain with n complete quadrangles. In this
On the Laplacian Spectrum and Kirchhoff Index of Generalized Phenylenes
Abstract Hexagonal and quadrilateral structures are very common in the molecular structure of organic chemistry, especially in polycyclic aromatic compounds. Let Ln be a generalized phenylene with t
Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons
A network is defined as an abstract structure which consists of nodes that are connected by links. In this paper, we study two types of rounded networks Nn (resp. Nn′). redBy using the recursive re...
Computing the Laplacian Spectrum of Linear Octagonal-Quadrilateral Networks and Its Applications
Let Ln denote linear octagonal-quadrilateral networks. In this paper, we aim to firstly investigate the Laplacian spectrum on the basis of Laplacian polynomial of Ln. Then, by applying the
On q-BFGS algorithm for unconstrained optimization problems
Variants of the Newton method are very popular for solving unconstrained optimization problems. The study on global convergence of the BFGS method has also made good progress. The q -gradient reduces
Spectrally accurate approximate solutions and convergence analysis of fractional Burgers’ equation
In this paper, a new numerical technique implements on the time-space pseudospectral method to approximate the numerical solutions of nonlinear time- and space-fractional coupled Burgers’ equation.
A novel low-cost method for generalized split inverse problem of finite family of demimetric mappings
The purpose of this paper is to introduce iterative method for solving generalized split inverse problem given as a task of finding a point which belongs to the intersection of finite family of fixed
Novel Numerical Scheme for Singularly Perturbed Time Delay Convection-Diffusion Equation
This paper deals with numerical treatment of singularly perturbed parabolic differential equations having large time delay. The highest order derivative term in the equation is multiplied by a
A novel approach of active control of structures based on the critically damped condition
In this research, the active control of structures based on the critically damped condition was proposed for reducing displacements and drifts of structures under seismic loading. In this approach,
...
1
2
...

References

SHOWING 1-10 OF 48 REFERENCES
Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed hexagonal chains
Let $G_n$ be a linear crossed polyomino chain with $n$ four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative degree-Kirchhoff index and the number
Kirchhoff index of linear hexagonal chains
The resistance distance rij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G
ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
Given a connected regular graph $G$, let $l(G)$ be its line graph, $s(G)$ its subdivision graph, $r(G)$ the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and
Resistance distance and the normalized Laplacian spectrum
Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
The Laplacian spectrum of graphs
The paper is essentially a survey of known results about the spectrum of the Laplacian matrix of graphs with special emphasis on the second smallest Laplacian eigenvalue λ2 and its relation to
Selected properties of the Schultz molecular topological index
  • I. Gutman
  • Mathematics, Computer Science
    J. Chem. Inf. Comput. Sci.
  • 1994
TLDR
The nontrivial part of MTI is the quantity S, and the new notation is preferred because the symbol S can be associated with the name of th discoverer of the "molecular topological index".
...
1
2
3
4
5
...