Volume 7 (2021)
On the Structure of Graphs with Integer Sombor Indices
Tomislav Došlić, Tamás Réti, Akbar Ali
Pages: 1-4 | DOI: 10.47443/dml.2021.0012
Bijections from Dyck and Motzkin Meanders with Catastrophes to Pattern Avoiding Dyck Paths
Jean-Luc Baril, Sergey Kirgizov
Pages: 5-10 | DOI: 10.47443/dml.2021.0032
On Hyper-Hamiltonian Cartesian Product of Undirected Cycles
Zbigniew R. Bogdanowicz
Pages: 11-13 | DOI: 10.47443/dml.2021.0022
Several Closed and Determinantal Forms for Convolved Fibonacci Numbers
Muhammet C. Dağlı, Feng Qi
Pages: 14-20 | DOI: 10.47443/dml.2021.0039
On Spectral Radius of the Generalized Distance Matrix of a Graph
Shariefuddin Pirzada
Pages: 21–23 | DOI: 10.47443/dml.2021.0040
The Sombor Index of Trees and Unicyclic Graphs with Given Maximum Degree
Ting Zhou, Zhen Lin, Lianying Miao
Pages: 24–29 | DOI: 10.47443/dml.2021.0035
Computing the Dependence of Graph Energy on Nullity: The Method of Siblings
Ivan Gutman
Pages: 30–33 | DOI: 10.47443/dml.2021.0038
Variations on Hammersley’s Interacting Particle Process
Arda Atalik, H. S. Melihcan Erol, Gökhan Yıldırım, Mustafa Yilmaz
Pages: 34–39 | DOI: 10.47443/dml.2021.0049
Minimum 2-Vertex Strongly Biconnected Spanning Directed Subgraph Problem
Raed Jaberi
Pages: 40–43 | DOI: 10.47443/dml.2021.0024
Hybrid Convolutions on Pell and Lucas Polynomials
Dongwei Guo, Wenchang Chu
Pages: 44–51 | DOI: 10.47443/dml.2021.0053
Bounds on Graph Energy and Randić Energy
Ş. Burcu Bozkurt Altındağ
Pages: 52–57 | DOI: 10.47443/dml.2021.0065
On the Non-Existence of Abelian Moore Cayley Graphs with Excess One
Wei He
Pages: 58–65 | DOI: 10.47443/dml.2021.0057
Vertex Identification in Trees
Yuya Kono, Ping Zhang
Pages: 66–73 | DOI: 10.47443/dml.2021.0042
An Asymptotic Relation Between the Wirelength of an Embedding and the Wiener Index
K. Jagadeesh Kumar, Sandi Klavžar, R. Sundara Rajan, Indra Rajasingh, T. M. Rajalaxmi
Pages: 74–78 | DOI: 10.47443/dml.2021.0063
A Note on Hyper-Plane Arrangements in $\mathbb{R}^d$
Nhattrieu Duong, Moshe Idan, Rom Pinchasi, Jason L. Speyer
Pages: 79–85 | DOI: 10.47443/dml.2021.0048
The Average Domination Polynomial of Graphs is Unimodal
Mohammad Reza Oboudi
Pages: 86–89 | DOI: 10.47443/dml.2021.0075
Restricted Coloring of $1$-by-$n$ Chessboards
Ronit Mansour, Amal Sharif-Rasslan
Pages: 90–93 | DOI: 10.47443/dml.2021.0068
Perfect Roman Domination in Middle Graphs
Kijung Kim
Pages: 94–97 | DOI: 10.47443/dml.2021.0066