Ara
Toplam kayıt 3, listelenen: 1-3
Edge domination in some brick product graphs
(Işık University Press, 2020)
Let G = (V, E) be a simple connected and undirected graph. A set F of edges in G is called an edge dominating set if every edge e in E ? F is adjacent to at least one edge in F. The edge domination number ?? (G) of G is ...
Laceability properties in edge tolerant corona product graphs
(Işık University Press, 2020)
A connected graph G is termed Hamiltonian-t-laceable if there exists in it a Hamiltonian path between every pair of vertices u and v with the property d(u, v) = t, 1 ≤ t ≤ diam(G), where t is a positive integer. The corona ...
Laceability properties in the image graph of Prism graphs
(Işık University Press, 2023-10)
A connected graph G is termed Hamiltonian-t-laceable if there exists in it a Hamiltonian path between every pair of vertices u and v with the property d(u, v) = t, 1 ? t ? diam(G), where t is a positive integer. In this ...