CombinatoricsConnected graphs in which any two of its cycles have at most one common vertex are called cactuses. In this paper, we continue the work on Laplacian spread of graphs, and determine the graph with maximal Laplacian spread in all cactuses with n vertices
AbstractIn this paper we study the complexity of finding a spanning cactus in various graphs. First,...
Let F be a family of graphs. Given an input graph G and a positive integer k, testing whether G has ...
A simple graph is reflexive if its second largest eigenvalue λ2 is less than or equal to 2. A graph ...
AbstractA connected graph G is a cactus if any two of its cycles have at most one common vertex. In ...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
Graphs and AlgorithmsThe Laplacian spread of a graph is defined to be the difference between the lar...
The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and t...
Abstract. A cactus graph is a connected graph in which every block is either an edge or a cycle. In ...
Among all connected cactuses with n vertices we find a unique graph whose largest eigenvalue (index,...
AbstractThe Laplacian spread s(G) of a graph G is defined to be the difference between the largest e...
Abstract. For a (molecular) graph, the first Zagreb indexM1 is equal to the sumof squares of its ver...
AbstractA dominating set in a graph G = (V,E) is a set of vertices D such that every vertex in V−D r...
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof...
AbstractIn this paper we study the complexity of finding a spanning cactus in various graphs. First,...
Let F be a family of graphs. Given an input graph G and a positive integer k, testing whether G has ...
A simple graph is reflexive if its second largest eigenvalue λ2 is less than or equal to 2. A graph ...
AbstractA connected graph G is a cactus if any two of its cycles have at most one common vertex. In ...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
AbstractThe Laplacian spread of a graph is defined to be the difference between the largest eigenval...
summary:The Laplacian spread of a graph is defined as the difference between the largest and second ...
Graphs and AlgorithmsThe Laplacian spread of a graph is defined to be the difference between the lar...
The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and t...
Abstract. A cactus graph is a connected graph in which every block is either an edge or a cycle. In ...
Among all connected cactuses with n vertices we find a unique graph whose largest eigenvalue (index,...
AbstractThe Laplacian spread s(G) of a graph G is defined to be the difference between the largest e...
Abstract. For a (molecular) graph, the first Zagreb indexM1 is equal to the sumof squares of its ver...
AbstractA dominating set in a graph G = (V,E) is a set of vertices D such that every vertex in V−D r...
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof...
AbstractIn this paper we study the complexity of finding a spanning cactus in various graphs. First,...
Let F be a family of graphs. Given an input graph G and a positive integer k, testing whether G has ...
A simple graph is reflexive if its second largest eigenvalue λ2 is less than or equal to 2. A graph ...
DOI
Add to ORKG