default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 311
Volume 311, April 2022
- Suresh Dara, Mathew C. Francis
, Dalu Jacob, N. Narayanan:
Extending some results on the second neighborhood conjecture. 1-17 - Jing Lin, Qinghou Zeng:
Maximum bipartite subgraphs in graphs without short cycles. 18-25 - Rashid Farooq, Laiba Mudusar:
Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree. 26-34
- Min Wang, Mengmeng Liu:
On the difference between the Szeged index and the Wiener index of cacti. 35-37
- Sarula Chang, Bit-Shun Tam, Jianxi Li, Yirong Zheng:
Graphs G with nullity 2c(G)+p(G)-1. 38-58 - Ting Yang, Xiying Yuan:
Nordhaus-Gaddum type inequality for the fractional matching number of a graph. 59-67 - Yun-Hao Zou, Jia Jie Liu, Shun-Chieh Chang, Chiun-Chieh Hsu:
The co-secure domination in proper interval graphs. 68-71 - K. Selvakumar, P. Gangaeswari, G. Arunkumar:
The Wiener index of the zero-divisor graph of a finite commutative ring with unity. 72-84 - Yaxian Zhang, Heping Zhang:
Relations between global forcing number and maximum anti-forcing number of a graph. 85-96 - Péter Györgyi, Tamás Kis:
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. 97-109
- Xuewei Hu, Bo Yang, Jing Zhang, Meijuan Huang:
Constructing totally disjoint spectra plateaued functions and searching five-value spectrum functions in odd variables. 110-128
- Xiao-Chen Li, Rong-Xia Hao:
The vertex Turán density in 3-ary n-cubes. 129-141 - Jinyu Zou, Yaping Mao, Zhao Wang, Eddie Cheng:
Fractional matching preclusion number of graphs. 142-153
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.
last updated on 2025-11-04 22:10 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:
