Subset Feedback Vertex Set in Chordal and Split Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Algorithmica"
DOI: 10.1007/s00453-019-00590-9
Abstract: AbstractIn the Subset Feedback Vertex Set (Subset-FVS) problem the input is a graph G on n vertices, a subset T of vertices of G called the “terminal” vertices, and an integer k. The task is… read more here.
Keywords: graphs; split graphs; subset fvs; time ... See more keywords
Isolated scattering number of split graphs and graph products
Sign Up to like & getrecommendations! Published in 2017 at "Anziam Journal"
DOI: 10.21914/anziamj.v58i0.11019
Abstract: Computer or communication networks are so designed that they do not easily get disrupted under external attack. Moreover, they are easily reconstructed when they do get disrupted. These desirable properties of networks can be measured… read more here.
Keywords: scattering number; split graphs; isolated scattering; number ... See more keywords
A Complete Characterization of Bidegreed Split Graphs with Four Distinct α-Eigenvalues
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14050899
Abstract: It is a well-known fact that a graph of diameter d has at least d+1 eigenvalues. A graph is d-extremal (resp. dα-extremal) if it has diameter d and exactly d+1 distinct eigenvalues (resp. α-eigenvalues), and… read more here.
Keywords: bidegreed split; distinct eigenvalues; split graphs; characterization bidegreed ... See more keywords