default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Yue 0002
Person information
- affiliation: Shandong Normal University, Jinan, Shandong, China
Other persons with the same name
- Jun Yue — disambiguation page
- Jun Yue 0001
![[0009-0004-6458-2510]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0009-0004-6458-2510")
— Ludong University, Yantai, Shandong, China - Jun Yue 0003 — Sun Yat-Sen University, Guangzhou, China
- Jun Yue 0004 — Central South University, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Zhipeng Gao, Yongtang Shi, Changqing Xi, Jun Yue:
The Extended Dominating Sets in Graphs. Asia Pac. J. Oper. Res. 40(5): 2340015:1-2340015:20 (2023)- 2021
- [j15]Zhongmei Qin, Yongxin Lan, Yongtang Shi, Jun Yue:
Exact rainbow numbers for matchings in plane triangulations. Discret. Math. 344(4): 112301 (2021) - 2020
- [j14]Jun Yue, Jiamei Song:
Note on the perfect Roman domination number of graphs. Appl. Math. Comput. 364 (2020) - [j13]Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang:
The Parallel Seeding Algorithm for k-Means Problem with Penalties. Asia Pac. J. Oper. Res. 37(4): 2040005:1-2040005:18 (2020) - [j12]Jun Yue, Shizhen Zhang, Yiping Zhu, Sandi Klavzar, Yongtang Shi:
The annihilation number does not bound the 2-domination number from the above. Discret. Math. 343(6): 111707 (2020) - [j11]Min Li, Dachuan Xu, Jun Yue, Dongmei Zhang, Peng Zhang:
The seeding algorithm for k-means problem with penalties. J. Comb. Optim. 39(1): 15-32 (2020)
2010 – 2019
- 2018
- [j10]Jun Yue, Meiqin Wei, Min Li, Guodong Liu:
On the double Roman domination of graphs. Appl. Math. Comput. 338: 669-675 (2018) - [j9]Jun Yue, Hui Lei, Yongtang Shi:
On the generalized Wiener polarity index of trees with a given diameter. Discret. Appl. Math. 243: 279-285 (2018) - 2017
- [j8]Yongtang Shi, Meiqin Wei, Jun Yue, Yan Zhao:
Coupon coloring of some special graphs. J. Comb. Optim. 33(1): 156-164 (2017) - 2016
- [j7]Jun Yue:
Acyclic and star coloring of P4-reducible and P4-sparse graphs. Appl. Math. Comput. 273: 68-73 (2016) - 2015
- [j6]Jiamei Song, Jun Yue:
Injective coloring of some graph operations. Appl. Math. Comput. 264: 279-283 (2015) - [j5]Xueliang Li, Jing Ma, Yongtang Shi, Jun Yue:
Note on a Turan-type problem on distances. Ars Comb. 119: 211-219 (2015) - [j4]Hengzhe Li, Xueliang Li, Yaping Mao, Jun Yue:
Note on the spanning-tree packing number of lexicographic product graphs. Discret. Math. 338(5): 669-673 (2015) - [j3]Xueliang Li, Meiqin Wei, Jun Yue:
Proper connection number and connected dominating sets. Theor. Comput. Sci. 607: 480-487 (2015) - 2014
- [j2]Xiaolong Huang, Xueliang Li, Yongtang Shi, Jun Yue, Yan Zhao:
Rainbow connections for outerplanar graphs with diameter 2 and 3. Appl. Math. Comput. 242: 277-280 (2014) - [j1]Jing Ma, Yongtang Shi, Jun Yue:
The Wiener Polarity Index of Graph Products. Ars Comb. 116: 235-244 (2014) - [c1]Xueliang Li, Jun Yue, Yan Zhao:
The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs. COCOA 2014: 412-425
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 2026-02-13 00:42 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:
