نتایج جستجو برای: minimum dominating distance signless laplacian energy
تعداد نتایج: 1043112 فیلتر نتایج به سال:
Recall that, given a graph G, the matrix Q = D + A is called the signless Laplacian, where A is the adjacency matrix and D is the diagonal matrix of vertex degrees. The matrix L = D − A is known as the Laplacian of G. Graphs with the same spectrum of an associated matrix M are called cospectral graphs with respect to M , or M–cospectral graphs. A graph H cospectral with a graph G, but not isomo...
The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) the Harary (also called matrix) while diag(RH(G)) represents diagonal of total vertices. In present work, some upper and lower bounds second-largest eigenvalue graphs in terms various parameters are investigated. Besides, all attaining these new characterized. Addi...
The investigation of the spectral distances of graphs that started in [3] (I. Jovanović, Z. Stanić, Spectral distances of graphs, Linear Algebra Appl., 436 (2012) 1425–1435.) is continued by defining Laplacian and signless Laplacian spectral distances and considering their relations to the spectral distances based on the adjacency matrix of graph. Some separate results concerning the defined di...
Nested split and double nested graphs (commonly named nested graphs) are considered. General statements regarding the signless Laplacian spectra are proven, and the nested graphs whose second largest signless Laplacian eigenvalue is bounded by a fixed integral constant are studied. Some sufficient conditions are provided and a procedure for classifying such graphs in particular cases is provide...
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید