Sign Up to like & get
recommendations!
1
Published in 2021 at "Journal of the Operations Research Society of China"
DOI: 10.1007/s40305-021-00358-5
Abstract: A fractional matching of a graph G is a function f: $$E(G)\rightarrow [0, 1]$$ such that for each vertex v, $$\sum \nolimits _{e \epsilon \Gamma _G (v)}f(e)\hbox {\,\,\char 054\,\,}1$$ . The fractional matching number of…
read more here.
Keywords:
distance laplacian;
fractional matching;
laplacian spectral;
matching number ... 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.08.012
Abstract: A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a…
read more here.
Keywords:
laplacian spectral;
characterization roses;
spectral characterization;
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