نتایج جستجو برای: signless laplacian
تعداد نتایج: 12702 فیلتر نتایج به سال:
Product graphs have been gainfully used in literature to generate mathematical models of complex networks which inherit properties of real networks. Realizing the duplication phenomena imbibed in the definition of corona product of two graphs, we define corona graphs. Given a small simple connected graph which we call basic graph, corona graphs are defined by taking corona product of the basic ...
Let G be a simple graph with order n and size m. The quantity $$M_1(G)=\sum _{i=1}^{n}d^2_{v_i}$$ is called the first Zagreb index of G, where $$d_{v_i}$$ degree vertex $$v_i$$ , for all $$i=1,2,\dots ,n$$ . signless Laplacian matrix $$Q(G)=D(G)+A(G)$$ A(G) D(G) denote, respectively, adjacency diagonal degrees G. $$q_1\ge q_2\ge \dots \ge q_n\ge 0$$ eigenvalues largest eigenvalue $$q_1$$ spectr...
Using Lotker’s interlacing theorem on the Laplacian eigenvalues of a graph in [5] and Wang and Belardo’s interlacing theorem on the signless Laplacian eigenvalues of a graph in [6], we in this note obtain spectral conditions for some Hamiltonian properties of graphs. 2010Mathematics Subject Classification : 05C50, 05C45
Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.
The spectrum of the Laplacian, signless Laplacian and adjacency matrices of the family of the weighted graphs R{H}, obtained from a connected weighted graph R on r vertices and r copies of a modified Bethe tree H by identifying the root of the i-th copy of H with the i-th vertex of R, is determined.
Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.
Let G be a weighted graph with Laplacian matrix L and signless Laplacian matrix Q. In this note, block representations for the group inverse of L and Q are given. The resistance distance in a graph can be obtained from the block representation of the group inverse of L.
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 se...
Several inequalities on vertex degrees, eigenvalues, Laplacian eigen-values, and signless Laplacian eigenvalues of graphs are presented in this note. Some of them are generalizations of the inequalities in [2]. We consider only finite undirected graphs without loops or multiple edges. Notation and terminology not defined here follow that in [1]. We use [n] to denote the set of { 1, 2, ..., n}. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید