
Sublinear Longest Path Transversals and Gallai Families
We show that connected graphs admit sublinear longest path transversals....
read it

B1EPG representations using blockcutpoint trees
In this paper, we are interested in the edge intersection graphs of path...
read it

Nonsingular (VertexWeighted) Block Graphs
A graph G is nonsingular (singular) if its adjacency matrix A(G) is nons...
read it

Intersection Graphs of Noncrossing Paths
We study graph classes modeled by families of noncrossing (NC) connecte...
read it

Nonsingular Block Graphs: An Open Problem
A block graph is a graph in which every block is a complete graph (cliqu...
read it

Regular decomposition of large graphs and other structures: scalability and robustness towards missing data
A method for compression of large graphs and matrices to a block structu...
read it

On fixable families of Boolean networks
The asynchronous dynamics associated with a Boolean network f : {0,1}^n ...
read it
Fiedler vector analysis for particular cases of connected graphs
In this paper, some subclasses of block graphs are considered in order to analyze Fiedler vector of its members. Two families of block graphs with cliques of fixed size, the blockpath and blockstarlike graphs, are introduced. Cases A and B of classification for both families were considered, as well as the behavior of the algebraic connectivity for particular cases of blockpath graphs.
READ FULL TEXT
Comments
There are no comments yet.