Sign Up to like & get
recommendations!
1
Published in 2017 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2017.07.012
Abstract: Abstract We introduce convex and quasiconvex functions on trees and prove that for a tree the eccentricity, transmission and weight functions are strictly quasiconvex. It is shown that the Perron vector of the distance matrix…
read more here.
Keywords:
distance signless;
distance;
signless laplacian;
quasiconvex functions ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2019.07.010
Abstract: Abstract Let G ‾ n , k denote the set of strongly connected digraphs with order n and arc connectivity k, and let G ‾ n , k ⁎ denote the set of digraphs in…
read more here.
Keywords:
spectral radius;
signless laplacian;
laplacian spectral;
radius among ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2020 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2019.12.038
Abstract: Abstract Turan type extremal problem is how to maximize the number of edges over all graphs which do not contain fixed forbidden subgraphs. Similarly, spectral Turan type extremal problem is how to maximize (signless Laplacian)…
read more here.
Keywords:
graphs;
spectral radius;
signless laplacian;
laplacian spectral ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2021 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2020.10.011
Abstract: Abstract In this paper, we investigate how the adjacency spectral radius and signless Laplacian spectral radius behave when a connected uniform hypergraph is perturbed by grafting edges. We extend the classical theorem of Li and…
read more here.
Keywords:
signless laplacian;
laplacian spectral;
adjacency;
spectral radii ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Asian-European Journal of Mathematics"
DOI: 10.1142/s1793557120501132
Abstract: The eccentricity of a vertex [Formula: see text] in a graph [Formula: see text] is the maximum distance between [Formula: see text] and any other vertex of [Formula: see text] A vertex with maximum eccentricity…
read more here.
Keywords:
distance signless;
see text;
signless laplacian;
formula see ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2020 at "Filomat"
DOI: 10.2298/fil2012215z
Abstract: We consider two classes of the graphs with a given bipartition. One is trees and the other is unicyclic graphs. The signless Laplacian coefficients and the incidence energy are investigated for the sets of trees/unicyclic…
read more here.
Keywords:
coefficients incidence;
signless laplacian;
given bipartition;
laplacian coefficients ... See more keywords