Search

The nonzero component graph of a finite-dimensional vector space over a finite field is a graph whose vertices are the nonzero vectors in the vector space, and any two vertices are adjacent if the corresponding linear combination contains a common basis vector. In this paper, we discuss the centrality measures and entropy of the nonzero component graph and also analyze the sensitivity of the graph using the centrality measures. [ABSTRACT FROM AUTHOR]

A new concept known as the orthogonal component graph associated with a finite-dimensional vector space over a finite field has been recently added as another class of algebraic graphs. In these types of graphs, the vertices will be all the possible non-zero linear combinations of orthogonal basis vectors, and any two vertices will be adjacent if the corresponding vectors are orthogonal. In this paper, we discuss the various colorings and structural properties of orthogonal component graphs. [ABSTRACT FROM AUTHOR]

A new concept known as the orthogonal component graph associated with a finite-dimensional vector space over a finite field has been recently added as another class of algebraic graphs. In these types of graphs, the vertices will be all the possible non-zero linear combinations of orthogonal basis vectors, and any two vertices will be adjacent if the corresponding vectors are orthogonal. In this paper, we discuss the various colorings and structural properties of orthogonal component graphs. [ABSTRACT FROM AUTHOR]

Some of the published results on super strongly perfect graphs are found to be erroneous. We provide some examples and counter examples on the concepts associated with super strongly perfects. [ABSTRACT FROM AUTHOR]