شماره ركورد كنفرانس :
4819
عنوان مقاله :
Minimum Edge Dominating Distance Energy of a Graph
عنوان به زبان ديگر :
Minimum Edge Dominating Distance Energy of a Graph
پديدآورندگان :
Sabetia Samira sabeti.samira@semnan.ac.ir Department of Mathematics, Statistics and Computer Science, Semnan University, Iran, , Mohammadian Semnani Saeed s_mohammadian@semnan.ac.ir Department of Mathematics, Statistics and Computer Science, Semnan University, Iran,
كليدواژه :
Minimum edge dominating set , Edge dominating distance matrix , Edge dominating distance eigenvalues , Graph energy
عنوان كنفرانس :
سومين همايش بين المللي تركيبيات، رمزنگاري و محاسبات
چكيده فارسي :
In this paper we introduce a new kind of graph energy, the minimum edge dominating distance energy, ED′d(G). The edge distance energy is defined as the sum of the absolute values of the eigenvalues of its edge distance matrix. Upper and lower bounds for ED′d(G) are established. Finally, we give lower bounds of the largest eigenvalue of G (= edge dominating distance spectral radius of graph G).
چكيده لاتين :
In this paper we introduce a new kind of graph energy, the minimum edge dominating distance energy, ED′d(G). The edge distance energy is defined as the sum of the absolute values of the eigenvalues of its edge distance matrix. Upper and lower bounds for ED′d(G) are established. Finally, we give lower bounds of the largest eigenvalue of G (= edge dominating distance spectral radius of graph G).
