Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Alhevaz Abdollah; Baghipur MARYAM; HASHEMI EBRAHIM

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2018 | Volume:4 | Issue:13 Page(s): 75-81

Download Full-Text

Persian Verion

View:

706

Download:

Cites:

Information Journal Paper

Title

Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs

Author(s)

Alhevaz Abdollah | Baghipur MARYAM | HASHEMI EBRAHIM | Issue Writer Certificate

Keywords

GraphQ1

Distance matrixQ1

distance signless Laplacian matrixQ1

Distance signless Laplacian energyQ1

Minimum dominating distance signless Laplacian energyQ1

Abstract

Let G be a simple connected Graph. The transmission of any vertex v of a Graph G is defined as the sum of distances of a vertex v from all other vertices in a Graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the Distance matrix of Graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating set of a Graph G, our aim in this paper is to define and study the so called minimum dominating distance signless Laplacian matrix, denoted by MDD^{Q}(G). We study some properties of the matrix MDD^{Q}(G). We also define the minimum dominating Distance signless Laplacian energy of a Graph G, denoted by EDD^{Q}(G), as the sum of the absolute values of the eigenvalues of MDD^{Q}(G), and give some upper and lower bounds for the energy and spectral radius of MDD^{Q}(G).

Cites

No record.

References

No record.

Cite

APA: Copy

Alhevaz, Abdollah, Baghipur, MARYAM, & HASHEMI, EBRAHIM. (2018). Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 4(13 ), 75-81. SID. https://sid.ir/paper/257359/en

Vancouver: Copy

Alhevaz Abdollah, Baghipur MARYAM, HASHEMI EBRAHIM. Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2018;4(13 ):75-81. Available from: https://sid.ir/paper/257359/en

IEEE: Copy

Abdollah Alhevaz, MARYAM Baghipur, and EBRAHIM HASHEMI, “Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 4, no. 13 , pp. 75–81, 2018, [Online]. Available: https://sid.ir/paper/257359/en

Related Journal Papers