AbstractLet G=(V,E) be a graph on n vertices. Denote by di=d(vi) the degree of vi∈V(G). Thenλ(G)⩽maxdi+di2+8dimi′2,vi∈V(G),where mi′=∑vivj∈E(dj-∣Ni∩Nj∣)di, ∣Ni∩Nj∣ is the number of common neighbors of vi and vj. Moreover, equality holds if and only if G is a bipartite regular graph
AbstractLet T be a tree with vertex set V. Let dv denotes the degree of v∈V. Let Δ=max{dv:v∈V}. Let ...
AbstractLet G be a graph with n vertices, μ1(G)⩾⋯⩾μn(G) be the eigenvalues of its adjacency matrix, ...
Abstract By using the way of weight functions and Hadamard's inequality, a half-discrete revers...
AbstractLet G=(V,E) be a graph, k∈N and let NG(v) and dG(v) denote the neighbourhood and degree of a...
AbstractLet G be a simple graph with n vertices, m edges. Let Δ and δ be the maximum and minimum deg...
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
Rigorous results are presented for the decay of eigenvalues of transfer matrices, based on the theor...
AbstractWe first show that the n-order superlinear delay differential equation with unstable type x(...
AbstractGiven n+1 angles 0≤θ0<θ1⋯<θn≤π, we discuss various extremal problems over the class of polyn...
AbstractIn Schweiger (2003) [1], Fritz Schweiger introduced the algorithm of the generalized continu...
The uniqueness theorem for the ergodic maximal operator is proved in the continuous case.The uniquen...
AbstractLet n>1 be an integer, f∈Cn[a,b], and A:C[a,b]→R a continuous linear functional which annihi...
AbstractIn this paper, some new results about the existence of positive solutions for singular semi-...
AbstractLet G be a graph with n vertices and m edges and let μ1(G)⩾⋯⩾μn(G) be the eigenvalues of its...
Let µ be the Jacobi measure supported on the interval [1; 1]. Let introduce the Sobolev-type inner ...
AbstractLet T be a tree with vertex set V. Let dv denotes the degree of v∈V. Let Δ=max{dv:v∈V}. Let ...
AbstractLet G be a graph with n vertices, μ1(G)⩾⋯⩾μn(G) be the eigenvalues of its adjacency matrix, ...
Abstract By using the way of weight functions and Hadamard's inequality, a half-discrete revers...
AbstractLet G=(V,E) be a graph, k∈N and let NG(v) and dG(v) denote the neighbourhood and degree of a...
AbstractLet G be a simple graph with n vertices, m edges. Let Δ and δ be the maximum and minimum deg...
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
Rigorous results are presented for the decay of eigenvalues of transfer matrices, based on the theor...
AbstractWe first show that the n-order superlinear delay differential equation with unstable type x(...
AbstractGiven n+1 angles 0≤θ0<θ1⋯<θn≤π, we discuss various extremal problems over the class of polyn...
AbstractIn Schweiger (2003) [1], Fritz Schweiger introduced the algorithm of the generalized continu...
The uniqueness theorem for the ergodic maximal operator is proved in the continuous case.The uniquen...
AbstractLet n>1 be an integer, f∈Cn[a,b], and A:C[a,b]→R a continuous linear functional which annihi...
AbstractIn this paper, some new results about the existence of positive solutions for singular semi-...
AbstractLet G be a graph with n vertices and m edges and let μ1(G)⩾⋯⩾μn(G) be the eigenvalues of its...
Let µ be the Jacobi measure supported on the interval [1; 1]. Let introduce the Sobolev-type inner ...
AbstractLet T be a tree with vertex set V. Let dv denotes the degree of v∈V. Let Δ=max{dv:v∈V}. Let ...
AbstractLet G be a graph with n vertices, μ1(G)⩾⋯⩾μn(G) be the eigenvalues of its adjacency matrix, ...
Abstract By using the way of weight functions and Hadamard's inequality, a half-discrete revers...
DOI
Add to ORKG