شماره ركورد كنفرانس :
4724
عنوان مقاله :
On energy of graphs with respect to dominating sets
پديدآورندگان :
Ahevaz Abdollah a.alhevaz@gmail.com Assistant Professor, Shahrood University of Technology, Shahrood؛ , Mirzaei Elaheh elahemirzaei01@gmail.com MSc Student, Shahrood University of Technology, Shahrood؛
كليدواژه :
Graphs , distance signless Laplacian matrix , dominating set , distance signless Laplacian energy , minimum dominating distance signless Laplacian energy
عنوان كنفرانس :
|اولين همايش ملي رياضي و آمار
چكيده فارسي :
The main purpose of this paper is to introduce the concept of minimum dominating distance signless Laplacian energy $ED^{Q}_D(G)$ of a graph $G.$ We also obtain some bounds on minimum dominating distance signless Laplacian energy of a graph and minimum dominating distance signless Laplacian spectral radius of $G$, which is the largest eigenvalue of the matrix $D^{Q}_{D}(G)$ of graphs.
