نتایج جستجو برای: minimum dominating distance signless laplacian energy
تعداد نتایج: 1043112 فیلتر نتایج به سال:
A connected graph is called Q-controllable if its signless Laplacian eigenvalues are mutually distinct and main. Two graphs G and H are said to be Q-cospectral if they share the same signless Laplacian spectrum. In this paper, infinite families of Q-controllable graphs are constructed, by using the operator of rooted product introduced by Godsil and McKay. In the process, infinitely many non-is...
In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized. In addition, these results disprove the two conjectures on the signless Laplacian spectral radius in [P. Hansen and C. Lucas, Bounds and conjectures for the signless Lapla...
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...
Parallel to the signless Laplacian spectral theory, we introduce and develop the nonlinear spectral theory of signless 1-Laplacian on graphs. Again, the first eigenvalue μ1 of the signless 1-Laplacian precisely characterizes the bipartiteness of a graph and naturally connects to the maxcut problem. However, the dual Cheeger constant h+, which has only some upper and lower bounds in the Laplacia...
For n ≥ 11, we determine all the unicyclic graphs on n vertices whose signless Laplacian spectral radius is at least n− 2. There are exactly sixteen such graphs and they are ordered according to their signless Laplacian spectral radii.
Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let [Formula: see text], [Formula: see text] and [Formula: see text] be the distance, distance Laplacian and distance signless Laplacian eigenvalues of G, respectively. In this paper, we give lower bounds on [Formula: see text], [Formula: see text], [For...
We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for developing a spectral theory of graphs based on this matrix. For regular graphs the whole existing theory of spectra of the adjacency matrix and of the Laplacian matrix transfers directly to the signless Laplacian, and so we consider arbitrary graphs with special emphasis on the non-regular case. The ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید