59 citations · 90 across the 42 of their papers we have counts for
42 papers
The statistical analysis for Sombor indices in a random polygonal chain networks
Jia-Bao Liu, Ya-Qian Zheng, Xin-Bei Peng
The Sombor indices, a new category of degree-based topological molecular descriptors, have been widely investigated due to their excellent chemical applicability. This paper aims t…
The (degree)-Kirchhoff index of linear crossed octagonal-quadrilateral networks
Jia-Bao Liu, Ting Zhang, Wenshui Lin
The Kirchhoff index and degree-Kirchhoff index have attracted extensive attentions due to its practical applications in complex networks, physics, and chemistry. In 2019, Liu et al…
The Laplacians, Kirchhoff index and complexity of linear Möbius and cylinder octagonal-quadrilateral networks
Jia-Bao Liu, Lu-Lu Fang, Qian Zheng +1
Spectrum graph theory not only facilitate comprehensively reflect the topological structure and dynamic characteristics of networks, but also offer significant and noteworthy appli…
The expected values, variances and limiting distributions of Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index for a class of random chain networks
Jia-Bao Liu, Qing Xie, Jiao-Jiao Gu
There has been an upsurge of research on complex networks in recent years. The purpose of this paper is to study the mathematical properties of the random chain networks PGn with t…
The expected values and limiting behaviours for the Gutman index, Schultz index, multiplicative degree-Kirchhoff index and additive degree-kirchhoff index of a random cyclooctane chain
Jia-Bao Liu, Jiao-Jiao Gu, Kang Wang
In this paper, we first introduce the explicit analytical formulas for the expected values of the Gutman and Schultz indices for a random cyclooctane chain COCn. Meanwhile, the exp…
Analyses of Some Structural Properties on a Class of Hierarchical Scale-free Networks
Jia-Bao Liu, Yan Bao, Wu-Ting Zheng
Hierarchical networks actually have many applications in the real world. Firstly, we propose a new class of hierarchical networks with scale-free and fractal structure, which are t…
The Normalized Laplacian Spectrum Analysis of Fractal Mobius Octagonal Networks and its Applications
Jia-Bao Liu, Ting Zhang, Wenshui Lin
The study and calculation of spectrum of networks can be used to describe networks structure and quantify analysis of networks performance. The fractal Möbius octagonal networks, d…
Multiset and Mixed Metric Dimension for Starphene and Zigzag-Edge Coronoid
Jia-Bao Liu, Sunny Kumar Sharma, Vijay Kumar Bhat +1
Let be a simple connected graph. A vertex is said to recognize (resolve) two different elements and from if $d(a, b_{1})\neq d(a, b_{2…
Metric dimension, doubly resolving set and strong metric dimension for
Jia-Bao Liu, Ali Zafari
A subset of vertices of a connected graph is a doubly resolving set of if for any various vertices we have $r(x|Q)-r(y|Q)\neqλI…
Edge Resolvability for Circular Ladder of Heptagons
Jia-Bao Liu, Sunny Kumar Sharma, Vijay Kumar Bhat +1
A set of elements (vertices or edges) in space is said to be a of a metric space if each element of the space is recognized by its distances from the eleme…
The Laplacian spectrum, Kirchhoff index and complexity of the linear heptagonal networks
Jia-Bao Liu, Jing Chen, Jing Zhao +1
Let be the linear heptagonal networks with heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian…
The Laplacian and normalized Laplacian spectra of Mobius polyomino networks and their applications
Zhi-Yu Shi, Jia-Bao Liu, Sakander Hayat
Spectral theory has widely used in complex networks and solved some practical problems. In this paper, we investigated the Laplacian and normalized Laplacian spectra of Mobius poly…
Ordering Trees by Their ABC Spectral Radii
Wenshui Lin, Zhangyong Yan, Peifang Fu +1
Let be a connected graph, where . Let denote the degree of vertex . The ABC matrix of is defined as $M(G)=(m_{ij})_{n \times n…
The (multiplicative degree-)Kirchhoff index of graphs derived from the Catersian product of and
Jia-Bao Liu, Xin-Bei Peng, Jiao-Jiao Gu +1
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…
On the Maximum ABC Spectral Radius of Connected Graphs and Trees
Wenshui Lin, Yiming Zheng, Peifang Fu +2
Let be a connected graph, where and . will denote the degree of vertex of , and . The ABC…
The normalized Laplacians and random walks of the parallel subdivision graphs
Jing Zhao, Jia-Bao Liu, Ying-Ying Tan +1
The -parallel subdivision graph is generated from which each edge of is replaced by parallel paths of length 2. The -parallel subdivision graph $S_{2k}(…
On Topological Properties of Planar Octahedron Networks
Haidar Ali, Farzana Kousar
Topological indices are scientific details of graphs which represents its topology and of the most part graph invariant. In QSAR/QSPR, physico-chemical characteristics and topologi…
Metric dimension, minimal doubly resolving sets and the strong metric dimension for jellyfish graph and cocktail party graph
Jia-Bao Liu, Ali Zafari, Hassan Zarei
Let be a simple connected undirected graph with vertex set and edge set . The metric dimension of a graph is the least number of vertices in a set with the pro…
Some resolving parameters in a class of Cayley graphs
Jia-Bao Liu, Ali Zafari
Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a…
Computing the Laplacian spectrum of linear octagonal-quadrilateral networks and its applications
Jia-Bao Liu, Zhi-Yu Shi, Ying-Hao Pan +3
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 appl…
Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
Jing Zhao, Jia-Bao Liu, Sakander Hayat
Resistance distance is a novel distance function, also a new intrinsic graph metric, which makes some extensions of ordinary distance. Let On be a linear crossed octagonal graph. R…
On the largest -spectral radius of cacti
Shaohui Wang, Chunxiang Wang, Jia-Bao Liu +1
Let be the adjacent matrix and the diagonal matrix of the degrees of a graph , respectively. For , the matrix is…
Some Relations on Paratopisms and An Intuitive Interpretation on the Parastrophes of a Latin Square
Wen-Wei Li, Jia-Bao Liu, Xin Hou
This paper will present some intuitive interpretation of the parastrophe transformations of arbitrary Latin square. With this trick, we can generate the parastrophes of arbitrary L…
Graphs having extremal monotonic topological indices with bounded vertex -partiteness
Fang Gao, Duo Duo Zhao, Xiao-Xin Li +1
The vertex -partiteness of graph is defined as the fewest number of vertices whose deletion from yields a -partite graph. In this paper, we introduce two con…