Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 295
Volume 295, May 2021
- Ping Li
, Xueliang Li:
Upper bounds for the MD-numbers and characterization of extremal graphs. 1-12 - Juan Monsalve, Juan Rada:
Vertex-degree based topological indices of digraphs. 13-24 - Muhuo Liu, Baogang Xu:
On a conjecture of Schweser and Stiebitz. 25-31 - Muhuo Liu, Kun Cheng, Boris Furtula:
Minimum augmented Zagreb index of c-cyclic graphs. 32-38 - Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomás Vetrík, Selvaraj Balachandran:
General sum-connectivity index of unicyclic graphs with given diameter. 39-46 - Adam Hamilton, Giang T. Nguyen, Matthew Roughan:
Counting Candy Crush configurations. 47-56 - Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. 57-69 - Ömer Egecioglu, Vesna Irsic:
Fibonacci-run graphs I: Basic properties. 70-84 - András Frank, Gergely Hajdu:
A simple algorithm and min-max formula for the inverse arborescence problem. 85-93 - Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Vertex-pancyclism in the generalized sum of digraphs. 94-101 - Wei Xiong, Sulin Song, Yikang Xie, Mingquan Zhan, Hong-Jian Lai:
Polynomially determining spanning connectivity of locally connected line graphs. 102-111 - Melissa A. Huggan, Richard J. Nowakowski:
Cops and an Insightful Robber. 112-119 - Célia Châtel, François Brucker, Pascal Préa:
Binary set systems and totally balanced hypergraphs. 120-133 - Xingyu Lei, Jianfeng Wang, Guozheng Li:
On the eigenvalues of eccentricity matrix of graphs. 134-147
a service of 
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 2024-07-05 21:14 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:
