default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 348
Volume 348, 2024
- Xuechun Zhang, Hongliang Lu, Qinglin Yu:
A note on the minimum size of matching-saturated graphs. 1-5 - Éric Duchêne, Arthur Dumas, Nacim Oijid
, Aline Parreau, Eric Rémila:
The Maker-Maker domination game in forests. 6-34 - Rong Zhang, Shu-Guang Guo:
Maxima of the Aα-index of graphs with given size and domination number. 35-45 - Yuanyuan Chen, Dan Li, Huiqiu Lin, Jixiang Meng:
Some graphs determined by their Aα-spectra. 46-55 - Margarita Domènech, José Miguel Giménez, María Albina Puente:
New characterizations and a concept of potential for each multinomial (probabilistic) value. 56-67 - Karel Devriendt, Andrea Ottolini, Stefan Steinerberger:
Graph curvature via resistance distance. 68-78 - Ting Zhou, Lianying Miao, Wenyao Song:
On the eccentric distance sum of trees with given maximum degree. 79-86 - Saeed Shaebani:
Concerning a conjecture on matching Kneser graphs. 87-90 - Shaun M. Fallat, Neha Joshi, Roghayeh Maleki, Karen Meagher, Seyed Ahmad Mojallal, Shahla Nasserasr, Mahsa N. Shirazi, Andriaherimanana Sarobidy Razafimahatratra, Brett Stevens:
The q-analogue of zero forcing for certain families of graphs. 91-104 - Alice Raffaele, Romeo Rizzi, Takeaki Uno:
Listing the bonds of a graph in O˜(n)-delay. 105-121 - Ivo Koch, Nina Pardal, Vinícius Fernandes dos Santos:
Edge deletion to tree-like graph classes. 122-131 - Wei Gao:
The minimum ABC index of chemical trees. 132-143 - Jialei Song, Baogang Xu:
Divisibility and coloring of some P5-free graphs. 144-151 - Pingshan Li, Min Xu, Eddie Cheng:
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs. 152-158 - Meng Tang, Fengxia Liu, Hong-Jian Lai:
The list r-hued coloring of Km,n. 159-164 - Yuanqiu Huang, Licheng Zhang, Fengming Dong:
A new note on 1-planar graphs with minimum degree 7. 165-183 - Licheng Zhang, Yuanqiu Huang:
On the sizes of generalized cactus graphs. 184-191 - Prahlad Narasimhan Kasthurirangan:
One-sided terrain guarding and chordal graphs. 192-201 - M. A. Shalu, V. K. Kirubakaran:
On CD-chromatic number and its lower bound in some classes of graphs. 202-210 - Grega Cigler, Piotr J. Wojciechowski:
Algebraic properties of soluble posets. 211-220 - Aida Abiad, Robin Simoens, Sjanne Zeijlemaker:
On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme. 221-230 - Rong Zou, Genjiu Xu, Wenzhong Li, Panfei Sun:
Values for cooperative games with a prior unions and a communication graph based on combined effects. 231-245 - Manoj Changat, Gokul Krishna Gopakumar-Sheejakumari, Prasanth G. Narasimha-Shenoi:
The median function of a block graph: Axiomatic characterizations. 246-259 - Atílio G. Luiz:
Roman domination and independent Roman domination on graphs with maximum degree three. 260-278 - Lin Zheng, Shuchao Li, Xiaobing Luo, Guangfu Wang:
Some sufficient conditions for a graph with minimum degree to be k-factor-critical. 279-291 - Hechao Liu, Lihua You:
Extremal Kirchhoff index in polycyclic chains. 292-300 - Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová:
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. 301-319
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-11-14 21:05 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:
