Eulerian and Hamiltonian properties of Gallai and anti-Gallai middle graphs
Künye
Goyal, S. & Jain, D. (2022). Eulerian and Hamiltonian properties of Gallai and anti-Gallai middle graphs. TWMS Journal Of Applied And Engineering Mathematics, 12(2), 536-546.Özet
The Gallai middle graph ΓM(G) of a graph G = (V, E) is the graph whose vertex set is V ∪ E and two edges ei, ej ∈ E are adjacent in ΓM(G), if they are adjacent edges of G and do not lie on a same triangle in G, or if ei = uv ∈ E then ei is adjacent to u and v in ΓM(G). The anti-Gallai middle graph ∆M(G) of a graph G = (V, E) is the graph whose vertex set is V ∪ E and two edges ei, ej ∈ E are adjacent in ∆M(G) if they are adjacent in G and lie on a same triangle in G, or if ei = uv ∈ E then ei is adjacent to u and v in ∆M(G). In this paper, we investigate Eulerian and Hamiltonian properties of Gallai and anti-Gallai middle graphs.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
12Sayı
2Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3834http://jaem.isikun.edu.tr/web/index.php/archive/115-vol12no2/839
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ... -
Distance spectra of some graph operations and some new distance equienergetic graphs of diameter 3
Adiga, Chandrashekar; Rakshith, B. R.; Sumithra (Işık University Press, 2019)Two graphs of same order are said to be distance equienergetic if their distance energies are same. In this paper, we first give a partial insight on the distance spectrum of Mycielskian graphs and then we focus on ...