default search action
Discrete Applied Mathematics, Volume 356
Volume 356, 2024
- Audace A. V. Dossou-Olory
:
The level matrix of a tree and its spectrum. 1-12 - Josiah Reiswig:
A note on the Steiner k-radius and Steiner k-diameter. 13-20 - Jing Gao, Ning Yang:
Some bounds on the largest eigenvalue of degree-based weighted adjacency matrix of a graph. 21-31 - Dhanyamol Antony
Spanning caterpillar in biconvex bipartite graphs. 32-36 - Lei Ren, Yongxin Lan, Changqing Xu:
The rainbow numbers of cycles in maximal bipartite planar graph. 37-43 - Kittikorn Nakprasit, Pongpat Sittitrai, Wannapol Pimpasalee
Planar graphs without 4- and 6-cycles are (3,4)-colorable. 44-51 - Elisabeth Gaar
On different versions of the exact subgraph hierarchy for the stable set problem. 52-70 - Meenakshi Kansal, Animesh Roy, Dibyendu Roy
Priority Arbiter PUF: Analysis. 71-95 - Yunping Li, Hanyuan Deng, Zikai Tang
Sombor index of maximal outerplanar graphs. 96-103 - Xiaowei Yu
An improved upper bound for neighbor sum distinguishing edge colorings of graphs. 104-109 - Geoffrey Boyer, Wayne Goddard:
Disjoint isolating sets and graphs with maximum isolation number. 110-116 - Xiaohui Yu
Fuzzy Harsanyi solutions for fuzzy level structure games with multi weight systems. 117-132 - Jorik Jooken
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs. 133-141 - Xiaoqin Hong
New constant dimension subspace codes from improved parallel subcode construction. 142-148 - Debasish Pattanayak
Graph exploration by a deterministic memoryless automaton with pebbles. 149-160 - Shujing Wang:
Maxima of the Q-index of leaf-free graphs with given size. 161-173 - Hongwei Qiao, Jixiang Meng, Eminjan Sabir:
The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree. 174-181 - Cheng-Hsiao Tsou, Ching-Chi Lin, Chan-Hung Hsu:
Finding broadcast 2-centers of a tree under the postal model. 182-190 - Nicolas Nisse, Lucas Picasarri-Arrieta
Redicolouring digraphs: Directed treewidth and cycle-degeneracy. 191-208 - Cristina Dalfó
On large regular (1,1,k)-mixed graphs. 209-228 - Pallabi Bora, Kukil Kalpa Rajkhowa
Laplacian and Wiener index of extension of zero divisor graph. 229-237 - Yibo Li, Ruiting Zhang, Qiong Fan
On the maximal augmented Zagreb index of unicyclic graphs with given girth. 238-246 - Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
New classes of Facets for complementarity knapsack problems. 247-262 - Kaiyang Lan
Borodin-Kostochka conjecture holds for K1,3¯-free graphs. 263-268 - Tomislav Doslic, Mate Puljiz, Stjepan Sebek
On a variant of Flory model. 269-292 - Michela Ascolese
Uniqueness and reconstruction of finite lattice sets from their line sums. 293-306 - Felicia Lucke
On blockers and transversals of maximum independent sets in co-comparability graphs. 307-321 - Gabriel Fortin-Leblanc, Gena Hahn, Frank Ramamonjisoa:
On cop-win dynamic graphs. 322-328 - Na Wang, Jixiang Meng, Yingzhi Tian:
Reliability analyses of regular graphs based on edge-structure connectivity. 329-342 - Jia-Bao Yang, Long-Tu Yuan:
A note on the stability results of the number of cliques in graphs with given matching number. 343-349 - José Luis Figueroa González
A project and lift approach for a 2-commodity flow relocation model in a time expanded network. 350-368 - Jenny Segschneider, Arie M. C. A. Koster:
Robust two-dose vaccination schemes and the directed b-matching problem. 369-392 - Shi-Cai Gong, Lu Lin:
On the construction of locally most reliable two-terminal graphs. 393-402
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-27 20:18 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: