default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 317
Volume 317, August 2022
- Jia Huang
:
Domination ratio of a family of integer distance digraphs with arbitrary degree. 1-9 - Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith:
Capture times in the bridge-burning cops and robbers game. 10-17 - Roberto Cruz, Ivan Gutman, Juan Rada:
Hosoya index of VDB-weighted graphs. 18-25 - Raffaella Mulas, Christian Kuehn, Tobias Böhle, Jürgen Jost:
Random walks and Laplacians on hypergraphs: When do they match? 26-41 - Florian Hörsch:
Checking the admissibility of odd-vertex pairings is hard. 42-48 - Simona Bonvicini, Maria Chiara Molinari:
Even Cycle Decompositions of index 3 by a novel coloring technique. 49-62 - Wanping Zhang, Jixiang Meng, Baoyindureng Wu:
Extremal graphs with respect to two distance-based topological indices. 63-74 - Debarun Ghosh, Ervin Györi, Addisu Paulos, Chuanqi Xiao, Oscar Zamora:
The Turán number of the triangular pyramid of 3-layers. 75-85 - Gi-Sang Cheon, Hong Joon Choi, Guillermo Esteban, Minho Song:
Enumeration of bipartite non-crossing geometric graphs. 86-100 - Yue Ma, Xinmin Hou, Jun Gao, Boyuan Liu, Zhi Yin:
Rainbow independent sets in graphs with maximum degree two. 101-108 - Sandi Klavzar, P. K. Neethu, S. V. Ullas Chandran:
The general position achievement game played on graphs. 109-116 - Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel:
The digrundy number of digraphs. 117-123 - Bostjan Bresar, Tanja Dravec, Aleksandra Gorzkowska, Elzbieta Kleszcz:
Graphs with a unique maximum independent set up to automorphisms. 124-135 - Morteza Hasanvand:
Equitable factorizations of edge-connected graphs. 136-145
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 2026-08-20 00: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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
