Convex and quasiconvex functions on trees and their applications
Sign Up to like & getrecommendations! 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
The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
Sign Up to like & getrecommendations! 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
The signless Laplacian spectral radius of graphs with forbidding linear forests
Sign Up to like & getrecommendations! 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
The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges
Sign Up to like & getrecommendations! 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
Quantum search with the signless Laplacian
Sign Up to like & getrecommendations! Published in 2025 at "Physical Review A"
DOI: 10.1103/physreva.111.032430
Abstract: Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may… read more here.
Keywords: laplacian quantum; signless laplacian; search; quantum walks ... See more keywords
Bounds for peripheral distance signless Laplacian eigenvalues of graphs
Sign Up to like & getrecommendations! 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
The signless Laplacian coefficients and the incidence energy of graphs with a given bipartition
Sign Up to like & getrecommendations! 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
The (n-1)-th Laplacian Immanantal Polynomials of Graphs
Sign Up to like & getrecommendations! Published in 2025 at "Axioms"
DOI: 10.3390/axioms14090716
Abstract: Let χn−1(σ) denote the irreducible character of the symmetric group Sn corresponding to the partition (n−1,1). For an n×n matrix M=(mi,j), we denote its (n−1)-th immanant by dn−1(M). Let G be a simple connected graph… read more here.
Keywords: immanantal polynomials; immanantal polynomial; signless laplacian; laplacian immanantal ... See more keywords
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Sign Up to like & getrecommendations! Published in 2025 at "Mathematics"
DOI: 10.3390/math13172720
Abstract: Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived… read more here.
Keywords: incidence; signless laplacian; harary incidence; incidence energy ... See more keywords