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 ...