Ara
Toplam kayıt 2, listelenen: 1-2
Directed pathos middle digraph of an arborescence
(Işık University Press, 2021)
A directed pathos middle digraph of an arborescence A?, written Q = DPM(A?), is the digraph whose vertex set V (Q) = V (A?) ? A(A?) ? P(A?), where V (A?) is the vertex set, A(A?) is the arc set, and P(A?) is a directed ...
On edge irregularity strength of ladder related graphs
(Işık University Press, 2024-04)
For a simple graph G, a vertex labeling ? : V (G) ? {1, 2, . . . , k} is called k-labeling. The weight of an edge xy in G, written w?(xy), is the sum of the labels of end vertices x and y, i.e., w?(xy) = ?(x) + ?(y). A ...