default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKexiang Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Zuwen Luo
, Kexiang Xu:
The number of connected sets in Apollonian networks. Appl. Math. Comput. 479: 128883 (2024)- [j37]Zuwen Luo, Kexiang Xu, Jing Tian:
Random subtrees and unimodal sequences in graphs. Discret. Math. 347(1): 113654 (2024) - [j36]Zuwen Luo, Kexiang Xu:
Computing the Number and Average Size of Connected Sets in Planar 3-Trees. Graphs Comb. 40(3): 55 (2024) - [j35]Kairui Nie, Kexiang Xu:
The doubly metric dimensions of cactus graphs and block graphs. J. Comb. Optim. 47(4): 67 (2024) - 2023
- [j34]Kairui Nie, Kexiang Xu:
Mixed metric dimension of some graphs. Appl. Math. Comput. 442: 127737 (2023) - [j33]Yuying Li, Peikang Zhang, Kexiang Xu:
The spectra of signed graphs obtained by $$\dot{H}$$-(generalized) join operation. Comput. Appl. Math. 42(2) (2023) - [j32]Zuwen Luo, Kexiang Xu:
On the Local and Global Mean Orders of Sub-$k$-Trees of $k$-Trees. Electron. J. Comb. 30(1) (2023) - [j31]Xinying Hua, Kexiang Xu, Hongbo Hua:
Relating the annihilation number and the total domination number for some graphs. Discret. Appl. Math. 332: 41-46 (2023) - [j30]Zuwen Luo, Kexiang Xu:
Extremal problems for connected set enumeration. Discret. Appl. Math. 340: 41-52 (2023) - [j29]Kexiang Xu, Jing Tian, Sandi Klavzar:
New transmission irregular chemical graphs. Discret. Appl. Math. 340: 286-295 (2023) - [j28]Zuwen Luo, Kexiang Xu, Stephan G. Wagner, Hua Wang:
On the mean subtree order of trees under edge contraction. J. Graph Theory 102(3): 535-551 (2023) - [j27]Yuying Li, Kexiang Xu:
Minimizing the number of edges in (Pk ∪ K3)-saturated connected graphs. RAIRO Oper. Res. 57(2): 447-458 (2023) - 2022
- [j26]Hongbo Hua, Xinying Hua, Sandi Klavzar, Kexiang Xu:
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs. Discret. Math. 345(9): 112965 (2022) - [j25]Kexiang Xu, Jie Li, Zuwen Luo:
Comparative results between the number of subtrees and Wiener index of graphs. RAIRO Oper. Res. 56(4): 2495-2511 (2022) - 2021
- [j24]Jing Tian, Kexiang Xu:
The general position number of Cartesian products involving a factor with small diameter. Appl. Math. Comput. 403: 126206 (2021) - [j23]Kexiang Xu, Sandi Klavzar:
Constructing new families of transmission irregular graphs. Discret. Appl. Math. 289: 383-391 (2021) - [j22]Kexiang Xu, Aleksandar Ilic, Vesna Irsic, Sandi Klavzar, Huimin Li:
Comparing Wiener complexity with eccentric complexity. Discret. Appl. Math. 290: 7-16 (2021) - [j21]Kexiang Xu, Jie Li, Hua Wang:
The number of subtrees in graphs with given number of cut edges. Discret. Appl. Math. 304: 283-296 (2021)
2010 – 2019
- 2019
- [j20]Muhuo Liu, Kexiang Xu, Xiao-Dong Zhang:
Extremal graphs for vertex-degree-based invariants with given degree sequences. Discret. Appl. Math. 255: 267-277 (2019) - 2018
- [j19]Kexiang Xu, Xiaoqian Gu, Ivan Gutman:
Relations between total irregularity and non-self-centrality of graphs. Appl. Math. Comput. 337: 461-468 (2018) - [j18]Kexiang Xu, Xia Li:
On domination game stable graphs and domination game edge-critical graphs. Discret. Appl. Math. 250: 47-56 (2018) - [j17]Kexiang Xu, Xia Li, Sandi Klavzar:
On graphs with largest possible game domination number. Discret. Math. 341(6): 1768-1777 (2018) - [j16]Kexiang Xu, Haiqiong Liu, Kinkar Chandra Das, Sandi Klavzar:
Embeddings into almost self-centered graphs of given radius. J. Comb. Optim. 36(4): 1388-1410 (2018) - 2017
- [j15]Kexiang Xu, Yaser Alizadeh, Kinkar Chandra Das:
On two eccentricity-based topological indices of graphs. Discret. Appl. Math. 233: 240-251 (2017) - 2016
- [j14]Kexiang Xu, Zhiqing Zheng, Kinkar Chandra Das:
Extremal t-apex trees with respect to matching energy. Complex. 21(5): 238-247 (2016) - [j13]Kexiang Xu, Kinkar Chandra Das:
Some extremal graphs with respect to inverse degree. Discret. Appl. Math. 203: 171-183 (2016) - [j12]Kinkar Chandra Das, Kexiang Xu, Yujun Yang:
Nordhaus-Gaddum-type results for resistance distance-based graph invariants. Discuss. Math. Graph Theory 36(3): 695-707 (2016) - [j11]Lihua Feng, Kexiang Xu, Kinkar Chandra Das, Aleksandar Ilic, Guihai Yu:
The number of spanning trees of a graph with given matching number. Int. J. Comput. Math. 93(6): 837-843 (2016) - [j10]Kexiang Xu, Kinkar Chandra Das, Xiao-Dong Zhang:
Ordering connected graphs by their Kirchhoff indices. Int. J. Comput. Math. 93(10): 1741-1755 (2016) - 2015
- [j9]Kexiang Xu, Jinlan Wang, Kinkar Chandra Das, Sandi Klavzar:
Weighted Harary indices of apex trees and k-apex trees. Discret. Appl. Math. 189: 30-40 (2015) - 2014
- [j8]Lihua Feng, Guihai Yu, Kexiang Xu, Zhengtao Jiang:
A note on the Kirchhoff index of bicyclic graphs. Ars Comb. 114: 33-40 (2014) - 2012
- [j7]Kexiang Xu, Jianxi Li, Lingping Zhong:
The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most k. Appl. Math. Lett. 25(3): 476-480 (2012) - [j6]Hongbo Hua, Shenggui Zhang, Kexiang Xu:
Further results on the eccentric distance sum. Discret. Appl. Math. 160(1-2): 170-180 (2012) - [j5]Kexiang Xu:
Trees with the seven smallest and eight greatest Harary indices. Discret. Appl. Math. 160(3): 321-331 (2012) - 2011
- [j4]Kexiang Xu:
The Zagreb indices of graphs with a given clique number. Appl. Math. Lett. 24(6): 1026-1030 (2011) - [j3]Kexiang Xu, Kinkar Chandra Das:
On Harary index of graphs. Discret. Appl. Math. 159(15): 1631-1640 (2011) - 2010
- [j2]Kexiang Xu:
On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number. Appl. Math. Lett. 23(4): 395-398 (2010)
2000 – 2009
- 2009
- [j1]Kexiang Xu, Baogang Xu:
Ordering graphs with maximum degree 3 by their indices. Ars Comb. 91 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
