ABSTRACT. In the paper, we extend known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product G +Dn, where the graph G consists of two ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results