Graphs Whose Independence Fractals are Line Segments
Sign Up to like & getrecommendations! Published in 2020 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-020-00936-5
Abstract: Let G be a simple graph. By an independent set in G , we mean a set of pairwise non-adjacent vertices in G . The independence polynomial of G is defined as $$I_G(z)=i_0 + i_1… read more here.
Keywords: independence fractals; line; graphs whose; number ... See more keywords
Graphs whose Laplacian eigenvalues are almost all 1 or 2
Sign Up to like & getrecommendations! Published in 2024 at "Special Matrices"
DOI: 10.1515/spma-2024-0015
Abstract: Abstract We explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2. read more here.
Keywords: graphs whose; whose laplacian; eigenvalues almost; laplacian eigenvalues ... See more keywords