default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShengjin Ji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Mengya He, Huixian Li, Ning Song, Shengjin Ji
:
The zero forcing number of claw-free cubic graphs. Discret. Appl. Math. 359: 321-330 (2024)- 2023
- [j16]Yu Jing, Wenqian Zhang, Shengjin Ji:
The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number. Graphs Comb. 39(4): 72 (2023) - [j15]Shengjin Ji, Mengya He, Guang Li, Yingui Pan, Wenqian Zhang:
Bounding the total forcing number of graphs. J. Comb. Optim. 46(4): 25 (2023) - 2022
- [j14]Mengmeng Liu, Shengjin Ji:
On minimum revised edge Szeged index of bicyclic graphs. AKCE Int. J. Graphs Comb. 19(3): 249-254 (2022) - [j13]Wenqian Zhang, Jianfeng Wang, Weifan Wang, Shengjin Ji:
On the Zero Forcing Number and Spectral Radius of Graphs. Electron. J. Comb. 29(1) (2022) - [j12]Mengya He, Shengjin Ji:
Note on Forcing Problem of Trees. Graphs Comb. 38(1): 3 (2022) - [j11]Mengya He, Shengjin Ji:
Correction to: Note on Forcing Problem of Trees. Graphs Comb. 38(1): 26 (2022) - [j10]Tongkun Qu, Shengjin Ji:
Extremal Structure on Revised Edge-Szeged Index with Respect to Tricyclic Graphs. Symmetry 14(8): 1646 (2022) - 2020
- [j9]Yan Yao, Shengjin Ji, Guang Li:
On the sharp bounds of bicyclic graphs regarding edge Szeged index. Appl. Math. Comput. 377: 125135 (2020) - 2018
- [j8]Shengjin Ji, Mengmeng Liu, Jianliang Wu:
A lower bound of revised Szeged index of bicyclic graphs. Appl. Math. Comput. 316: 480-487 (2018) - [j7]Shengjin Ji, Qiuju Bian, Jianfeng Wang, Jianliang Wu:
On the first reformulated Zagreb indices of graphs with a given clique number. Ars Comb. 140: 3-11 (2018) - 2017
- [j6]Gang Ma, Shengjin Ji, Qiuju Bian, Xia Li:
The minimum matching energy of tricyclic graphs and given girth and without K4-subdivision. Ars Comb. 132: 403-419 (2017) - 2016
- [j5]Gang Ma, Shengjin Ji, Qiuju Bian, Xia Li:
The maximum matching energy of bicyclic graphs with even girth. Discret. Appl. Math. 206: 203-210 (2016) - 2015
- [j4]Suonan Renqian, Yunpeng Ge, Bofeng Huo, Shengjin Ji, Qiangqiang Diao:
On the tree with diameter 4 and maximal energy. Appl. Math. Comput. 268: 364-374 (2015) - [j3]Shengjin Ji, Yongke Qu, Xia Li:
The reformulated Zagreb indices of tricyclic graphs. Appl. Math. Comput. 268: 590-595 (2015) - [j2]Hongping Ma, Yongqiang Bai, Shengjin Ji:
On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3. Discret. Appl. Math. 186: 186-198 (2015) - 2014
- [j1]Shengjin Ji, Hongping Ma:
The Extremal Matching Energy of Graphs. Ars Comb. 115: 343-355 (2014)
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-09-10 02:08 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:
