Results 211 to 220 of about 286,371 (234)

Distance signless Laplacian eigenvalues of graphs

Frontiers of Mathematics in China, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Chandra, Lin, Huiqiu, Guo, Jiming   +2 more
openaire   +1 more source

On the multiplicities of distance Laplacian eigenvalues

Computational and Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rosário Fernandes, Maria A. A. de Freitas, Celso M. da Silva, Renata R. Del-Vecchio   +3 more
openaire   +2 more sources

On distance Laplacian and distance signless Laplacian eigenvalues of graphs

Linear and Multilinear Algebra, 2018
Let D(G), DL(G)=Diag(Tr)−D(G) and DQ(G)=Diag(Tr)+D(G) be, respectively, the distance matrix, the distance Laplacian matrix and the distance signless Laplacian matrix of graph G, where Diag(Tr) deno...
Kinkar Ch. Das, Mustapha Aouchiche, Pierre Hansen   +2 more
openaire   +1 more source

Distance metric learning with eigenvalue fine tuning

2017 International Joint Conference on Neural Networks (IJCNN), 2017
Distance metric learning focuses on learning one global or multiple local distance functions to draw similar instances close to each other and push away dissimilar ones. Most existing work has to do matrix projection to learn distance functions. In this paper, we present a novel distance function learning model which is based on eigenvalue fine tuning.
Wenquan Wang, Ya Zhang, Jinglu Hu
openaire   +1 more source

Distance metric learning with eigenvalue optimization

2012
Summary: The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning approach called DML-eig which is shown to be equivalent to a well-known eigenvalue optimization problem called minimizing the maximal eigenvalue of a symmetric matrix.
Ying, Yiming, Peng, Li
openaire   +1 more source

Maximum eigenvalue of the reciprocal distance matrix

Journal of Mathematical Chemistry, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Some Results on the Eigenvalues of Distance-Regular Graphs

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bang, Sejeong, Koolen, Jack H., Park, Jongyook   +2 more
openaire   +2 more sources

Eigenvalues, diameter, and mean distance in graphs

Graphs and Combinatorics, 1991
Let \(A\) be the adjacency matrix of the graph \(G\) and let \(D\) be the diagonal matrix with \(i\)-th diagonal entry equal to the valence of the \(i\)-th vertex of \(G\). The Laplacian matrix of \(G\) is \(D-A\). The all-ones vector lies in the kernel of \(D-A\), so its least eigenvalue is zero.
openaire   +1 more source

Distance-regular graphs whose distance matrix has only one prositive eigenvalue

European Journal of Combinatorics, 1994
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we classify the graphs in the title.
Koolen, J.H., Shpectorov, S.V.
openaire   +1 more source

On the Sum and Spread of Reciprocal Distance Laplacian Eigenvalues of Graphs in Terms of Harary Index

Symmetry, 2022
Saleem Khan, Shariefuddin Pirzada, Yilun Shang   +2 more
exaly