default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 384
Volume 384, 2026
- Yifan Li, Shuming Zhou
, Qifan Zhang:
Neighbor connectivity of hypercube-based compound network. 1-15 - Gideon Amir, Yaakov Malinovsky:
Uniqueness of maximum scores in countable-outcome round-robin tournaments. 16-22 - Chenke Zhang, Qing Cui, Jinze Hu, Erfei Yue, Shengjin Ji:
Some results on minimum saturated graphs. 23-33 - Bilal Ahmad Rather, Hilal Ahmad Ganie, Jainfeng Wang:
Distance signless Laplacian spectra of graphs: A survey. 41-138 - Pingshan Li, Ke Yang, Wei Jin:
A note on the second-largest number of dissociation sets in connected graphs. 34-40 - Zi-Ming Zhou, Zhibin Du, Chang-Xiang He:
Extremal graphs for the sum of the first two largest signless Laplacian eigenvalues. 139-144 - Yahui Zhang, Yan Li, Changxiang He:
On some critical Ramsey numbers involving paths. 145-153 - Junqing Cai, Meirun Chen, Cheng-Kuan Lin:
Dimensional edge fault-tolerant Hamiltonicity of (folded) hypercubes. 154-164 - Ming Jiang, Xiaogang Liu, Jing Wang:
Pair state transfer in tensor product and double cover. 165-176 - Martin E. Dyer, Haiko Müller:
Thick Forests. 177-200 - Esteban De Jesús Sánchez, Abel Cabrera Martínez, Ismael Ríos Villamar, José María Sigarreta:
On the (total) domination in subdivision graphs. 201-210 - Taiki Yamada:
Vertex evaluation of multiplex graphs using Forman curvature. 211-228 - Fernando Esteban Contreras-Mendoza, César Hernández-Cruz:
Polarity on H -split graphs. 229-242 - Daoxia Zhang, Dan Li, Wenxiu Ding:
Extremal distance spectra of graphs and essential connectivity. 243-255 - Jiahao Yu, Min Chen:
On 2-distance ( 2 Δ + 6 )-coloring of planar graphs. 256-267 - Rongxia Tang, Zhaojun Chen, Zan-Bo Zhang:
Construction, extension and paths of near-homogeneous tournaments. 268-280 - Rahul Das, Ushnish Sarkar:
A note on robber locating game. 281-286 - Alan M. Frieze, Ravi Kannan, Wesley Pegden:
Aspects of a randomly growing cluster in R d , d ≥ 2. 287-292 - Gabriela Araujo-Pardo, Claudia De la Cruz, Martín Matamala, Miguel A. Pizaña:
Weighted cages. 293-308 - Zhidan Feng, Henning Fernau, Kevin Mann:
Enumerating minimal defensive alliances. 309-325 - Deqing Xu, Bo Deng, Hongjian Lai:
Tutte polynomials of single interior pericondensed hexagonal systems. 326-339 - Bernard De Baets, Emilio De Santis:
Voting profiles admitting all candidates as knockout winners. 340-351 - Shu-Li Zhao, Bao-Cheng Zhang:
The pendant-tree connectivity of some regular graphs. 352-360 - Chuanye Zheng, Liqiong Xu:
Assessing reliability of 3-ary n -cubes based on the h -extra r -component edge-connectivity. 361-371 - Weixing Zheng, Shuming Zhou, Lulu Yang:
Fault tolerability of Cayley graphs generated by transposition unicyclic graphs with a triangle. 372-385 - Liying Zhao, Shumin Zhang, Bo Zhu, Jou-Ming Chang:
Neighbor connectivity of bubble-sort star graphs. 386-396 - Cristian M. Conde, Ezequiel Dratman, Veronica A. Moyano, Adrián Pastine:
Commutative distance degree-regular graphs. 397-410
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-07-19 01:31 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.
