default search action
Shoujun Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j50]Cai-Xia Wang, Yu Yang, Shou-Jun Xu:
The algorithm and complexity of co-secure domination in geometric intersection graphs. Comput. Appl. Math. 44(1): 22 (2025) - [j49]Xiaoyun Lv, Jianxi Li, Shou-Jun Xu:
Some results on {K2,C2i+1:i≥1}-factor in a graph. Discret. Appl. Math. 360: 81-92 (2025) - [j48]Wensheng Sun, Yujun Yang, Shou-Jun Xu
:
Resistance distance and Kirchhoff index of unbalanced blowups of graphs. Discret. Math. 348(3): 114327 (2025) - [j47]Jie Chen, Yi-Ping Liang, Cai-Xia Wang, Shou-Jun Xu:
Algorithmic aspects of {P}-isolation in graphs and extremal graphs for a {P3}-isolation bound. Inf. Process. Lett. 187: 106521 (2025) - 2024
- [j46]Muhammad Shoaib Sardar
Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs. Appl. Math. Comput. 473: 128670 (2024) - [j45]Tingzeng Wu
Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices. Axioms 13(5): 330 (2024) - [j44]Wensheng Sun
On the Resistance Distance and Kirchhoff Index of Kn-chain(Ring) Network. Circuits Syst. Signal Process. 43(8): 4728-4749 (2024) - [j43]Yong-De Feng, Yan-Ting Xie
The extendability of Cayley graphs generated by transpositions. Discret. Appl. Math. 343: 134-139 (2024) - [j42]Xiaomeng Wang, Lina Wei, Shou-Jun Xu
Subgroup total perfect codes in Cayley sum graphs. Des. Codes Cryptogr. 92(9): 2599-2613 (2024) - [j41]Xiao-Lu Gao, Jing Huang
Comparability digraphs: An analogue of comparability graphs. Discret. Math. 347(3): 113829 (2024) - [j40]Xiaomeng Wang, Shou-Jun Xu:
On subgroup regular sets in Cayley sum graphs. Discret. Math. 347(9): 114059 (2024) - [j39]Hongzhang Chen
Spectral bounds for the zero forcing number of a graph. Discuss. Math. Graph Theory 44(3): 971 (2024) - [j38]Yi-Ping Liang
Semitotal forcing in claw-free cubic graphs. Discuss. Math. Graph Theory 44(4): 1373-1393 (2024) - [j37]Jie Chen
Semitotal domination in claw-free graphs. Discuss. Math. Graph Theory 44(4): 1585-1605 (2024) - [j36]Jie Chen, Cai-Xia Wang, Yi-Ping Liang, Shou-Jun Xu
A Characterization of Graphs with Semitotal Domination Number One-Third Their Order. Graphs Comb. 40(4): 73 (2024) - [j35]Yu Yang, Cai-Xia Wang, Shou-Jun Xu:
Total (restrained) domination in unit disk graphs. Inf. Comput. 300: 105210 (2024) - [j34]Fazal Hayat
Minimizing the second Zagreb eccentricity index in bipartite graphs with a fixed size and diameter. J. Appl. Math. Comput. 70(5): 5049-5061 (2024) - [j33]Shou-Jun Xu
A Survey on Variant Domination Problems in Geometric Intersection Graphs. Parallel Process. Lett. 34(1): 2340018:1-2340018:20 (2024) - [c2]Cai-Xia Wang, Yu Yang, Ze-Peng Li, Shou-Jun Xu:
The Characterizations and Complexity of Roman {2}-Domination and 2-Domination in Graphs. AAIM (2) 2024: 182-193 - 2023
- [j32]Yong-De Feng, Yan-Ting Xie
A note on characterization of the induced matching extendable Cayley graphs generated by transpositions. Discret. Appl. Math. 333: 84-89 (2023) - [j31]Yi-Ping Liang, Shou-Jun Xu
On graphs maximizing the zero forcing number. Discret. Appl. Math. 334: 81-90 (2023) - [j30]Jie Chen, Shou-Jun Xu
P5-isolation in graphs. Discret. Appl. Math. 340: 331-349 (2023) - [j29]Yan-Ting Xie, Yong-De Feng, Shou-Jun Xu
Characterization of 2-arc-transitive partial cubes. Discret. Math. 346(1): 113190 (2023) - [j28]Cai-Xia Wang, Yu Yang, Shou-Jun Xu:
Algorithmic aspects of secure domination in unit disk graphs. Inf. Comput. 295(Part B): 105090 (2023) - [j27]Yu Yang, Cai-Xia Wang, Shou-Jun Xu
Algorithmic and complexity aspects of problems related to total restrained domination for graphs. J. Comb. Optim. 46(5): 28 (2023) - [j26]Qiongzheng Hu, Haina Jia, Yuhong Wang, Shoujun Xu:
Force-Induced Visualization of Nucleic Acid Functions with Single-Nucleotide Resolution. Sensors 23(18): 7762 (2023) - [j25]Cai-Xia Wang, Yu Yang, Shou-Jun Xu
Secure connected domination and secure total domination in unit disk graphs and rectangle graphs. Theor. Comput. Sci. 957: 113824 (2023) - [i1]Fazal Hayat, Shou-Jun Xu:
Solution to an open problem on the closeness of graphs. CoRR abs/2311.18671 (2023) - 2022
- [j24]Yi-Ping Liang, Jianxi Li, Shou-Jun Xu
On Extremal Graphs for Zero Forcing Number. Graphs Comb. 38(6): 185 (2022) - 2021
- [j23]Jie Chen, Shou-Jun Xu:
A characterization of 3-γ-critical graphs which are not bicritical. Inf. Process. Lett. 166: 106062 (2021) - [j22]Cai-Xia Wang, Yu Yang, Hong-Juan Wang, Shou-Jun Xu
Roman {k}-domination in trees and complexity results for some classes of graphs. J. Comb. Optim. 42(1): 174-186 (2021) - [j21]Xiaomeng Wang
Independent perfect dominating sets in semi-Cayley graphs. Theor. Comput. Sci. 864: 50-57 (2021) - 2020
- [j20]Lianying Miao, Jingru Pang, Shoujun Xu:
On the extremal values of the eccentric distance sum of trees with a given maximum degree. Discret. Appl. Math. 284: 375-383 (2020) - [j19]Xiao-Lu Gao, Shou-Jun Xu:
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j18]Zhuo Pan, Yu Yang, Xianyue Li
The complexity of total edge domination and some related results on trees. J. Comb. Optim. 40(3): 571-589 (2020) - [j17]Zhuo Pan, Xianyue Li, Shou-Jun Xu
Complexity and characterization aspects of edge-related domination for graphs. J. Comb. Optim. 40(3): 757-773 (2020) - [c1]Xiaomeng Wang
Independent Perfect Domination Sets in Semi-Cayley Graphs. AAIM 2020: 436-447
2010 – 2019
- 2019
- [j16]Yan-Ting Xie
On the maximum value of the eccentric distance sums of cubic transitive graphs. Appl. Math. Comput. 359: 194-201 (2019) - [j15]Zepeng Li, Zehui Shao, Shoujun Xu:
2-Rainbow domination stability of graphs. J. Comb. Optim. 38(3): 836-845 (2019) - 2018
- [j14]Qing-Hua He, Shou-Jun Xu:
Hosoya polynomials of random phenylene chains. Ars Comb. 141: 259-268 (2018) - [j13]Damir Vukicevic, Shuang Zhao, Jelena Sedlar
Global forcing number for maximal matchings. Discret. Math. 341(3): 801-809 (2018) - 2017
- [j12]Yan-Ting Xie, Shou-Jun Xu:
Nested unimodality. Australas. J Comb. 69: 119-129 (2017) - [j11]Yi-Ting Chen, Arati G. Kolhatkar, Oussama Zenasni, Shoujun Xu, T. Randall Lee
Biosensing Using Magnetic Particle Detection Techniques. Sensors 17(10): 2300 (2017) - 2016
- [j10]Shou-Jun Xu, Xiu-Song Liu, Wai Hong Chan, Heping Zhang
Complete forcing numbers of primitive coronoids. J. Comb. Optim. 32(1): 318-330 (2016) - 2015
- [j9]Qing-Hua He, Shou-Jun Xu:
Schultz polynomial and modified Schultz polynomial of a random benzenoid chain. Ars Comb. 120: 39-50 (2015) - [j8]Shou-Jun Xu, Heping Zhang
Complete forcing numbers of catacondensed hexagonal systems. J. Comb. Optim. 29(4): 803-814 (2015) - [j7]Shou-Jun Xu, Rob Gysel, Dan Gusfield:
Minimum Average Distance Clique Trees. SIAM J. Discret. Math. 29(3): 1706-1734 (2015) - 2014
- [j6]Shou-Jun Xu, Haiyang Chen, Qiu-Xia Zhang, Liangping Tu:
Hosoya polynomials of twisted toroidal polyhexes. Ars Comb. 114: 417-425 (2014) - 2013
- [j5]Shou-Jun Xu, Xianyue Li, Ronghua Liang:
Moplex orderings generated by the LexDFS algorithm. Discret. Appl. Math. 161(13-14): 2189-2195 (2013)
2000 – 2009
- 2008
- [j4]Shoujun Xu, Heping Zhang
Hosoya polynomials under gated amalgamations. Discret. Appl. Math. 156(12): 2407-2419 (2008) - [j3]Heping Zhang
None of the coronoid systems can be isometrically embedded into a hypercube. Discret. Appl. Math. 156(14): 2817-2822 (2008) - [j2]Shoujun Xu, Heping Zhang
The Hosoya polynomial decomposition for catacondensed benzenoid graphs. Discret. Appl. Math. 156(15): 2930-2938 (2008) - [j1]Shoujun Xu, Heping Zhang
The Hosoya polynomial decomposition for hexagonal chains. Math. Comput. Model. 48(3-4): 601-609 (2008)
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-12-02 21:33 CET 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: