1 citations · 1 across the 5 of their papers we have counts for
6 papers
Maximum number of spanning trees in bipartite graphs with a given diameter
Shaohan Xu, Ivan Damnjanović, Kexiang Xu
The number of spanning trees is a classical graph invariant and an important measure of network reliability, as it counts the minimal connected spanning substructures that can main…
Edge transmission irregular graphs
Kexiang Xu, Ivan Damnjanović, Uroš Milivojević +1
The transmission of a vertex in a connected graph is the sum of distances from to all vertices in . A transmission irregular (TI) graph is a connected graph in which…
On the transmission irregular trees with the maximum Wiener index
Ivan Damnjanović, Anran Xu, Kexiang Xu
The transmission of a vertex in a (chemical) graph is the sum of distances from to other vertices in . If any two vertices of have different transmissions, then…
Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
Shaohan Xu, Kexiang Xu, Ivan Damnjanović
The number of spanning trees in a graph is the total number of distinct spanning subgraphs of that are trees. In this paper we characterize the unique graph with a prescrib…
Vertex-transitive nut graph order-degree existence problem
Ivan Damnjanović
A nut graph is a nontrivial simple graph whose adjacency matrix has a simple eigenvalue zero such that the corresponding eigenvector has no zero entries. It is known that the order…
On the maximum spectral radius of connected graphs with a prescribed order and size
Ivan Damnjanović
The spectral radius of a graph is the largest modulus of an eigenvalue of its adjacency matrix. Let be the set of all the connected simple graphs with vert…