default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 361
Volume 361, 2025
- Jing Gao, Xueliang Li, Ning Yang, Ruiling Zheng:
Maximum energy bicyclic graphs containing two odd cycles with one common vertex. 1-21 - Kamal Dliou
:
Independence, matching and packing coloring of the iterated Mycielskian of graphs. 22-33 - Jing Lou, Ruifang Liu, Jinlong Shu:
Toughness and distance spectral radius in graphs involving minimum degree. 34-47 - Xiaoyan Lai, Yishuo Shi:
Approximation algorithm of maximizing non-submodular functions under non-submodular constraint. 48-68 - Weimin Qian, Feng Li:
Exact vertex forwarding index of the Strong product of complete graph and cycle. 69-84 - Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Well-indumatched Pseudoforests. 85-102 - Sean McGuinness:
Serial exchanges in random bases. 103-110 - Yasir Ahmad, Xiang-Feng Pan, Umar Ali, Zhuo Diao:
Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains. 111-120 - Zakir Deniz:
An improved bound for 2-distance coloring of planar graphs with girth six. 121-135 - Bilal Ahmad Rather, Mustapha Aouchiche:
Distance Laplacian spectra of graphs: A survey. 136-195 - Tobias Boege, Janneke H. Bolt, Milan Studený:
Self-adhesivity in lattices of abstract conditional independence models. 196-225
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-21 20:30 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:
