Sign Up to like & get
recommendations!
0
Published in 2017 at "Integral Equations and Operator Theory"
DOI: 10.1007/s00020-017-2407-5
Abstract: We prove that in dimension $$n \ge 2$$n≥2, within the collection of unit-measure cuboids in $$\mathbb {R}^n$$Rn (i.e. domains of the form $$\prod _{i=1}^{n}(0, a_n)$$∏i=1n(0,an)), any sequence of minimising domains $$R_k^\mathcal {D}$$RkD for the Dirichlet…
read more here.
Keywords:
cuboids optimising;
asymptotic behaviour;
rightarrow infty;
laplacian eigenvalues ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2018 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2017.11.031
Abstract: Abstract In this work, the graphs of order n having the second distance Laplacian eigenvalue of multiplicity n − 2 are determined. Besides that, this result also characterizes the graphs where the multiplicity of some…
read more here.
Keywords:
multiplicity;
multiplicities distance;
laplacian eigenvalues;
distance laplacian ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2018 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2018.08.003
Abstract: Abstract Let G be a graph with n vertices and m edges, and let S k ( G ) be the sum of the k largest Laplacian eigenvalues of G. It was conjectured by Brouwer…
read more here.
Keywords:
conjecture sum;
laplacian eigenvalues;
improved results;
brouwer conjecture ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2022 at "Symmetry"
DOI: 10.3390/sym14091937
Abstract: The reciprocal distance Laplacian matrix of a connected graph G is defined as RDL(G)=RT(G)−RD(G), where RT(G) is the diagonal matrix of reciprocal distance degrees and RD(G) is the Harary matrix. Clearly, RDL(G) is a real…
read more here.
Keywords:
rdl rdl;
distance laplacian;
distance;
laplacian eigenvalues ... See more keywords