Degree equivalence graph of a graph
Künye
Rajendra, R., Siva Kota Reddy, P. & Madhusudhan, K. V. (2020). Degree equivalence graph of a graph. TWMS Journal Of Applied And Engineering Mathematics, 10(2), 411-414.Özet
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex set S. Given a graph with vertex set V , we can define an equivalence relation on V using the concept of degree of a vertex as follows: two vertices a and b in V are related if and only if they are of same degree. The degree equivalence graph of a graph G is the equivalence graph with vertex set V with respect to the above equivalence relation. In this paper, we study some properties of degree equivalence graph of a graph.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
10Sayı
2Bağlantı
https://hdl.handle.net/11729/2828http://jaem.isikun.edu.tr/web/index.php/archive/105-vol10no2/531
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 ... -
On certain topological indices of the derived graphs of subdivision graphs
Hosamani, Sunilkumar M.; Lokesha, Veerebradiah; Cangül, İsmail Naci; Devendraiah, K. M. (Işık University Press, 2016-03-11)The derived graph [G]† of a graph G is the graph having the same vertex set as G, with two vertices of [G]† being adjacent if and only if their distance in G is two. Topological indices are valuable in the study of QSAR/QSPR. ...