Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
Sign Up to like & getrecommendations! Published in 2017 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-017-9924-7
Abstract: Decomposition methods for optimal spanning trees on graphs are explored in this work. The attention is focused on optimization problems where the objective function depends only on the degrees of the nodes of the tree.… read more here.
Keywords: vertices degree; articulation vertices; decomposition methods; based articulation ... See more keywords
Q-integral graphs with at most two vertices of degree greater than or equal to three
Sign Up to like & getrecommendations! Published in 2020 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2020.03.027
Abstract: Abstract Let G a graph on n vertices. The signless Laplacian matrix of G, denoted by Q ( G ) , is defined as Q ( G ) = D ( G ) + A… read more here.
Keywords: graphs two; two vertices; vertices degree; integral graphs ... See more keywords