default search action
Discussiones Mathematicae Graph Theory, Volume 40
Volume 40, Number 1, 2020
- A. Tamil Elakkiya
, Appu Muthusamy:
Gregarious kite factorization of tensor product of complete graphs. 7-24 - Mei Lu, Wenjie Ning, Kun Wang:
Bounds on the locating-total domination number in trees. 25-34 - Panpan Li, Wenzhong Liu:
Decompositions of cubic traceable graphs. 35-49 - Stanislav Jendrol'
Conflict-free vertex-connections of graphs. 51-65 - Tomás Vetrík
On the metric dimension of directed and undirected circulant graphs. 67-76 - Long Tang, Elkin Vumar:
A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs. 77-84 - Tian Tian, Liming Xiong:
2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices. 85-106 - Vincent E. Coll, Jonelle Hook, Colton Magnant, Karen McCready, Kathleen Ryan:
The proper diameter of a graph. 107-125 - Olivier Hudry, Antoine Lobstein:
The compared costs of domination, location-domination and identification. 127-147 - Zbigniew R. Bogdanowicz
On the minimum number of spanning trees in cubic multigraphs. 149-159 - Lihua Feng, Minmin Liu, Weijun Liu, Pengli Zhang:
Spectral conditions for graphs to be k-Hamiltonian or k-path-coverable. 161-179 - Faraha Ashraf, Martin Baca, Susana-Clara López, Francesc Antoni Muntaner-Batle, Akito Oshima, Andrea Semanicová-Fenovcíková
On total H-irregularity strength of the disjoint union of graphs. 181-194 - Xihe Li
Deficiency and forbidden subgraphs of connected, locally-connected graphs. 195-208 - David Amos, John Asplund, Boris Brimkov, Randy Davila:
The Slater and sub-k-domination number of a graph with applications to domination and k-domination. 209-225 - Yan Zhao:
More on the minimum size of graphs with given rainbow index. 227-241 - Chang-Qing Xu, Xue Zhao:
Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles. 243-253 - Doost Ali Mojdeh
Roman 2-bondage number of a graph. 255-268 - Igor Fabrici
Longer cycles in essentially 4-connected planar graphs. 269-277 - Martin Sonntag, Hanns-Martin Teichert:
Niche hypergraphs of products of digraphs. 279-295 - Weihua Lu, Han Ren, Chao Yang
Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs. 297-305 - Andrew Arokiaraj, Sandi Klavzar, Paul D. Manuel
Strong geodetic problems in networks. 307-321 - Bojan Vuckovic:
An improved upper bound on neighbor expanded sum distinguishing index. 323-329 - Yuanyuan Duan, Lianying Miao, Wenyao Song:
Neighbor sum distinguishing total choosability of IC-planar graphs. 331-344 - Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták
Incidence coloring-cold cases. 345-354 - Maximilian Fürst, Dieter Rautenbach:
A short proof for a lower bound on the zero forcing number. 355-360
Volume 40, Number 2, 2020
- Milica Andelic, Francesco Belardo
Preface. 365-366 - Dragos M. Cvetkovic, Peter Rowlinson:
Slobodan Simić: an appreciaton. 367-378 - Nair Abreu
Graphs with all but two eigenvalues in [-2, 0]. 379-391 - Saieed Akbari
Signed complete graphs with maximum index. 393-403 - Milica Andelic
On regular signed graphs with three eigenvalues. 405-416 - Francesco Belardo
Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs. 417-433 - Johann A. Briffa
On the displacement of eigenvalues when removing a twin vertex. 435-450 - Domingos M. Cardoso
Graphs with clusters perturbed by regular graphs - Aα-spectrum and applications. 451-466 - Sebastian M. Cioaba
Some observations on the smallest adjacency eigenvalue of a graph. 467-493 - Kennteth Dadedzi, Valisoa Razanajatovo Misanantenaina
On the distance spectral radius of trees with given degree sequence. 495-524 - Carlos M. da Fonseca, Zhibin Du
The number of P-vertices of singular acyclic matrices: An inverse problem. 525-532 - Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur
Existence of regular nut graphs for degree at most 11. 533-557 - Haiyan Guo
On the α-spectral radius of uniform hypergraphs. 559-575 - Willem H. Haemers
Cospectral pairs of regular graphs with different connectivity. 577-584 - Steve Kirkland, Xiaohong Zhang:
Fractional revival of threshold graphs under Laplacian dynamics. 585-600 - Vladimir Nikiforov:
Turan's theorem implies Stanley's bound. 601-605 - K. Pinheiro, Bruna S. Souza, Vilmar Trevisan:
Determining graphs by the complementary spectrum. 607-620 - Peter Rowlinson:
On trees as star complements in regular graphs. 621-636 - Nicola Milosavljevic', Dragan Stevanovic
A few examples and counterexamples in spectral graph theory. 637-662 - Jack H. Koolen, Ying-Ying Tan, Zheng-Jiang Xia:
A spectral characterization of the s-clique extension of the triangular graphs. 663-676 - Francesco Belardo
Graphs whose Aα radius does not exceed 2. 677-690
Volume 40, Number 3, 2020
- Liying Kang, Erfang Shan, Min Zhao:
Power domination in the generalized Petersen graphs. 695-712 - Eddie Cheng
2-spanning cyclability problems of the some generalized Petersen graphs. 713-731 - Randy Davila, Michael A. Henning:
Total forcing sets and zero forcing sets in trees. 733-754 - Norbert Polat:
On some properties of antipodal partial cubes. 755-770 - Mostafa Blidia, Ahmed Bouchou, Mustapha Chellali:
Extremal graphs for a bound on the Roman domination number. 771-785 - Sha-Sha Li, Jian-Hua Yin:
On factorable bigraphic pairs. 787-793 - Anton Bernshteyn, Omid Khormali, Ryan R. Martin
Regular colorings in regular graphs. 795-806 - Yumei Hu, Yongtang Shi, Yarong Wei:
The edit distance function of some graphs. 807-821 - Zhen-Chun Chen, Hung-Chih Lee:
Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars. 823-839 - Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Equating k maximum degrees in graphs without short cycles. 841-853 - Axel Brandt, Sogol Jahanbekam, Jennifer White:
Additive list coloring of planar graphs with given girth. 855-873 - Saeid Alikhani
Trees with distinguishing index equal distinguishing number plus one. 875-884 - Krzysztof Giaro
A note on polynomial algorithm for cost coloring of bipartite graphs with ? \le 4. 885-891 - Ewa Drgas-Burchardt
Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common. 893-917
Volume 40, Number 4, 2020
- Bostjan Bresar, Jasmina Ferme
A survey on packing colorings. 923-970 - Zhihong He, Mei Lu:
Super edge-connectivity and zeroth-order Randiæ index. 971-984 - Oleg V. Borodin, Anna O. Ivanova
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. 985-994 - Lutz Volkmann:
The double Roman domatic number of a digraph. 995-1004 - Bin Liu, Lin Sun, Bing Wang, Jian-Liang Wu:
The list coloring and list total coloring of planar graphs with maximum degree at least 7. 1005-1024 - Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9. 1025-1033 - Nawarat Ananchuen, Pawaton Kaemawichanurat:
Connected domination critical graphs with cut vertices. 1035-1055 - Mikio Kano, Zheng Yan:
Strong Tutte type conditions and factors of graphs. 1057-1065 - Izak Broere, Johannes Heidema, Stefan Veldsman:
Congruences and Hoehnke radicals on graphs. 1067-1084 - Majid Hajian, Nader Jafari Rad
A note on the fair domination number in outerplanar graphs. 1085-1093 - Andreas M. Hinz, Nazanin Movarraei:
The Hanoi graph H34. 1095-1109 - Ivan Gutman, Hongbo Hua, Hongzhuan Wang:
Comparing eccentricity-based graph invariants. 1111-1125 - Zhandong Ouyang:
A note on the crossing numbers of 5-regular graphs. 1127-1140 - Matjaz Krnc, Jean-Sébastien Sereni, Riste Skrekovski
Eccentricity of networks with structural constraints. 1141-1162 - Mieczyslaw Borowiecki
Graph classes generated by Mycielskians. 1163-1173 - Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak
On a total version of 1-2-3 Conjecture. 1175-1186
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 2025-01-16 21:52 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: