6 papers
Quadratic form estimations for Hessian matrices of resistance distance and Kirchhoff index of positive-weighted graphs
Yu Li, Lizhu Sun, Changjiang Bu
Let be a positive-weighted graph with the weight for all . The weighted graph is called a hyper-dual number…
The high order spectral radius of graphs without long cycles or paths
Yuntian Wang, Lizhu Sun, Changjiang Bu
In 1959, ErdÅs and Gallai established two classic theorems, which determine the maximum number of edges in an -vertex graph with no cycles of length at least , and in an …
The ordering of hypertrees and unicyclic hypergraphs by the traces of -tensor
Jueru Liu, Lizhu Sun, Changjiang Bu
For a real number and a -uniform hypergraph , is called the $\m…
An -triangle eigenvector centrality of graphs
Zhang Qingying, Sun Lizhu, Bu Changjiang
Centrality represents a fundamental research field in complex network analysis, where centrality measures identify important vertices within networks. Over the years, researchers h…
The resistance distance of a dual number weighted graph
Yu Li, Lizhu Sun, Changjiang Bu
For a graph , assigning each edge a weight of a dual number , the weighted graph is called a dual number weight…
The subgraph eigenvector centrality of graphs
Qingying Zhang, Lizhu Sun, Changjiang Bu
Let be a connected graph and let be a connected subgraph of with a given structure. We consider that the centrality of a vertex of is determined by the centrali…