Let πΊ = (π, πΈ) be a connected graph. A locating-total dominating set in a graph πΊ is a total dominating set π of a πΊ, for every pair of vertices π, πβ π(πΊ) \ π, such that π(π) β©π = β ...
Carpathian Journal of Mathematics, Vol. 34, No. 2 (2018), pp. 143-155 (13 pages) In the paper, we extend known results concerning crossing numbers for join of graphs of order six. We give the crossing ...
Graph crossing numbers quantify the minimum number of edge intersections in any planar drawing of a graph, an essential parameter in both theoretical and applied graph theory. The study of crossing ...
Small separations in symmetric graphs (with B. Mohar) in preparation. Symmetric graphs with no K_n minor (with B. Mohar) in preparation Evolutionarily distinct species capture more phylogenetic ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback