Kexiang Xu

Orcid: 0000-0002-9376-5226

According to our database1, Kexiang Xu authored at least 39 papers between 2009 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On the number of F,4-saturating edges.
Appl. Math. Comput., 2025

2024
The doubly metric dimensions of cactus graphs and block graphs.
J. Comb. Optim., May, 2024

Computing the Number and Average Size of Connected Sets in Planar 3-Trees.
Graphs Comb., May, 2024

Random subtrees and unimodal sequences in graphs.
Discret. Math., January, 2024

The number of connected sets in Apollonian networks.
Appl. Math. Comput., 2024

2023
New transmission irregular chemical graphs.
Discret. Appl. Math., December, 2023

Extremal problems for connected set enumeration.
Discret. Appl. Math., December, 2023

Relating the annihilation number and the total domination number for some graphs.
Discret. Appl. Math., June, 2023

Minimizing the number of edges in (<i>P</i><sub><i>k</i></sub> ∪ <i>K</i><sub>3</sub>)-saturated connected graphs.
RAIRO Oper. Res., March, 2023

The spectra of signed graphs obtained by $$\dot{H}$$-(generalized) join operation.
Comput. Appl. Math., March, 2023

On the mean subtree order of trees under edge contraction.
J. Graph Theory, 2023

On the Local and Global Mean Orders of Sub-$k$-Trees of $k$-Trees.
Electron. J. Comb., 2023

Mixed metric dimension of some graphs.
Appl. Math. Comput., 2023

2022
Comparative results between the number of subtrees and Wiener index of graphs.
RAIRO Oper. Res., 2022

Relating the total domination number and the annihilation number for quasi-trees and some composite graphs.
Discret. Math., 2022

2021
The number of subtrees in graphs with given number of cut edges.
Discret. Appl. Math., 2021

Constructing new families of transmission irregular graphs.
Discret. Appl. Math., 2021

Comparing Wiener complexity with eccentric complexity.
Discret. Appl. Math., 2021

The general position number of Cartesian products involving a factor with small diameter.
Appl. Math. Comput., 2021

2019
Extremal graphs for vertex-degree-based invariants with given degree sequences.
Discret. Appl. Math., 2019

2018
Embeddings into almost self-centered graphs of given radius.
J. Comb. Optim., 2018

On graphs with largest possible game domination number.
Discret. Math., 2018

On domination game stable graphs and domination game edge-critical graphs.
Discret. Appl. Math., 2018

Relations between total irregularity and non-self-centrality of graphs.
Appl. Math. Comput., 2018

2017
On two eccentricity-based topological indices of graphs.
Discret. Appl. Math., 2017

2016
Ordering connected graphs by their Kirchhoff indices.
Int. J. Comput. Math., 2016

The number of spanning trees of a graph with given matching number.
Int. J. Comput. Math., 2016

Nordhaus-Gaddum-type results for resistance distance-based graph invariants.
Discuss. Math. Graph Theory, 2016

Some extremal graphs with respect to inverse degree.
Discret. Appl. Math., 2016

Extremal <i>t</i>-apex trees with respect to matching energy.
Complex., 2016

2015
Weighted Harary indices of apex trees and k-apex trees.
Discret. Appl. Math., 2015

2014
A note on the Kirchhoff index of bicyclic graphs.
Ars Comb., 2014

2012
Trees with the seven smallest and eight greatest Harary indices.
Discret. Appl. Math., 2012

Further results on the eccentric distance sum.
Discret. Appl. Math., 2012

The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most k.
Appl. Math. Lett., 2012

2011
On Harary index of graphs.
Discret. Appl. Math., 2011

The Zagreb indices of graphs with a given clique number.
Appl. Math. Lett., 2011

2010
On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number.
Appl. Math. Lett., 2010

2009
Ordering graphs with maximum degree 3 by their indices.
Ars Comb., 2009


  Loading...