• Title/Summary/Keyword: G-power

Search Result 4,956, Processing Time 0.071 seconds

DISTINGUISHING NUMBER AND DISTINGUISHING INDEX OF STRONG PRODUCT OF TWO GRAPHS

  • Alikhani, Saeid;Soltani, Samaneh
    • Honam Mathematical Journal
    • /
    • v.42 no.4
    • /
    • pp.645-651
    • /
    • 2020

  • The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. The strong product G ☒ H of two graphs G and H is the graph with vertex set V (G) × V (H) and edge set {{(x1, x2),(y1, y2)}|xiyi ∈ E(Gi) or xi = yi for each 1 ≤ i ≤ 2.}. In this paper we study the distinguishing number and the distinguishing index of strong product of two graphs. We prove that for every k ≥ 2, the k-th strong power of a connected S-thin graph G has distinguishing index equal two.

  • https://doi.org/10.5831/HMJ.2020.42.4.645 인용 PDF KSCI