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 block-path and block-starlike 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 block-path graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2020

Sublinear Longest Path Transversals and Gallai Families

We show that connected graphs admit sublinear longest path transversals....
research
02/14/2023

Non-empty intersection of longest paths in H-free graphs

We make progress toward a characterization of the graphs H such that eve...
research
06/09/2021

B1-EPG representations using block-cutpoint trees

In this paper, we are interested in the edge intersection graphs of path...
research
05/06/2019

Nonsingular (Vertex-Weighted) Block Graphs

A graph G is nonsingular (singular) if its adjacency matrix A(G) is nons...
research
11/25/2022

Causal Vector Autoregression Enhanced with Covariance and Order Selection

A causal vector autoregressive (CVAR) model is introduced for weakly sta...
research
11/23/2017

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...
research
04/09/2020

Storing Set Families More Compactly with Top ZDDs

Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for ...

Please sign up or login with your details

Forgot password? Click here to reset