default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuoliang Hao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Guoliang Hao
, Xiaodan Chen, Seyed Mahmoud Sheikholeslami, Haining Jiang:
Roman [1,2]-domination of graphs. Appl. Math. Comput. 468: 128520 (2024)- [j16]Guoliang Hao, Shouliu Wei, Seyed Mahmoud Sheikholeslami, Xiaodan Chen:
Bounds on the global double Roman domination number in graphs. Discuss. Math. Graph Theory 44(2): 539 (2024) - 2023
- [j15]Guoliang Hao, Parvin Jalilolghadr, Doost Ali Mojdeh:
Perfect double Italian domination of a graph. AKCE Int. J. Graphs Comb. 20(3): 247-257 (2023) - [j14]Guoliang Hao, Zhihong Xie, Seyed Mahmoud Sheikholeslami, M. Hajjari:
Bounds on the total double Roman domination number of graphs. Discuss. Math. Graph Theory 43(4): 1033-1061 (2023) - 2021
- [j13]Saeed Kosari, Zehui Shao, R. Khoeilar, Hossein Karami, Seyed Mahmoud Sheikholeslami, Guoliang Hao:
On a conjecture concerning total domination subdivision number in graphs. AKCE Int. J. Graphs Comb. 18(3): 154-157 (2021) - [j12]Doost Ali Mojdeh, Guoliang Hao, Iman Masoumi, Ali Parsian:
Unique response strong Roman dominating functions of graphs. Electron. J. Graph Theory Appl. 9(2): 469-484 (2021) - [j11]Zheng Kou, Saeed Kosari, Guoliang Hao, Jafar Amjadi, Nesa Khalili:
Quadruple Roman Domination in Trees. Symmetry 13(8): 1318 (2021) - 2020
- [c1]Guoliang Hao, Wanli Ni, Hui Tian, Leilei Cao:
Mobility-Aware Trajectory Design for Aerial Base Station Using Deep Reinforcement Learning. WCSP 2020: 1131-1136
2010 – 2019
- 2019
- [j10]Guoliang Hao, Seyed Mahmoud Sheikholeslami, Shouliu Wei:
Italian Reinforcement Number in Graphs. IEEE Access 7: 184448-184456 (2019) - [j9]Xiaodan Chen, Guoliang Hao, Zhihong Xie:
A note on Roman domination of digraphs. Discuss. Math. Graph Theory 39(1): 13-21 (2019) - [j8]Xiaodan Chen, Guoliang Hao, Lutz Volkmann:
Bounds on the signed Roman k-domination number of a digraph. Discuss. Math. Graph Theory 39(1): 67-79 (2019) - 2018
- [j7]Xiaodan Chen, Guoliang Hao:
Extremal graphs with respect to generalized ABC index. Discret. Appl. Math. 243: 115-124 (2018) - [j6]Zhuang Wei, Guoliang Hao:
Semitotal domination in trees. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j5]Guoliang Hao, Jianguo Qian:
Bounds on the domination number of a digraph. J. Comb. Optim. 35(1): 64-74 (2018) - 2017
- [j4]Guoliang Hao:
On the domination number of digraphs. Ars Comb. 134: 51-60 (2017) - [j3]Guoliang Hao:
Rainbow connection of the join of two paths. Ars Comb. 135: 243-247 (2017) - 2016
- [j2]Guoliang Hao, Jianguo Qian:
On the Rainbow Domination Number of Digraphs. Graphs Comb. 32(5): 1903-1913 (2016) - 2015
- [j1]Guoliang Hao, Jianguo Qian:
On the sum of out-domination number and in-domination number of digraphs. Ars Comb. 119: 331-337 (2015)
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-10-07 22:06 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:
