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 π(π) β©π = β ...
Graph distinguishing numbers constitute a vital parameter in understanding the symmetry properties of graphs. Fundamentally, the distinguishing number of a graph is the minimal number of labels ...
Cayley graphs provide a powerful and intuitive framework linking group theory with graph theory by representing groups through vertices and edges defined by a generating set. In the realm of finite ...
Stefan BereΕΎný, Michal StaΕ‘, Cyclic permutations and crossing numbers of join products of symmetric graph of order six, Carpathian Journal of Mathematics, Vol. 34, No. 2 (2018), pp. 143-155 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback