نتایج جستجو برای: seidel signless laplacian eigenvalues

تعداد نتایج: 31915  

2013
GUANGLONG YU SHUGUANG GUO MEILING XU

For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.

Journal: :Electr. J. Comb. 2010
Saieed Akbari Ebrahim Ghorbani Jacobus H. Koolen Mohammad Reza Oboudi

Let G be a graph of order n with signless Laplacian eigenvalues q1, . . . , qn and Laplacian eigenvalues μ1, . . . , μn. It is proved that for any real number α with 0 < α 6 1 or 2 6 α < 3, the inequality qα 1 + · · · + qα n > μ1 + · · · + μn holds, and for any real number β with 1 < β < 2, the inequality q 1 + · · ·+ q n 6 μβ1 + · · ·+ μ β n holds. In both inequalities, the equality is attaine...

2014
NATHAN REFF

An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are ...

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...

Journal: :Discrete Applied Mathematics 2013
Jianfeng Wang Francesco Belardo

In this paper, we investigate the relation between the Q -spectrum and the structure of G in terms of the circumference of G. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its Q -spectrum. We also determine the graphs with exactly one or two Q -eigenvalues greater than or equal to 2 and obtain all minimal forbidden subgraphs and maximal ...

2008
D. CVETKOVIĆ Ivan Gutman D. Cvetković

AMS Mathematics Subject Classification (2000): 05C50

Journal: :Linear Algebra and its Applications 2014

2017
Dan Li Guoping Wang Jixiang Meng DAN LI GUOPING WANG JIXIANG MENG

Let η(G) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper, bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless Laplacian spectral radius among the graphs with given vertex connectivity and minimum degree is determined. Furthermore, the digraph that minimize...

Journal: :Czechoslovak Mathematical Journal 2008

2017
A. Dilek Maden A. Sinan Cevik A. DILEK MADEN A. SINAN CEVIK

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید