4 research outputs found
A relation between multiplicity of nonzero eigenvalues and the matching number of graph
Let be a graph with an adjacent matrix . The multiplicity of an
arbitrary eigenvalue of is denoted by . In
\cite{Wong}, the author apply the Pater-Wiener Theorem to prove that if the
diameter of at least , then for any
. Moreover, they characterized all trees with
, where is the induced matching number of
.
In this paper, we intend to extend this result from trees to any connected
graph. Contrary to the technique used in \cite{Wong}, we prove the following
result mainly by employing algebraic methods: For any non-zero eigenvalue
of the connected graph , , where
is the cyclomatic number of , and the equality holds if and only if
or , or a tree with the diameter is at most
. Furthermore, if , we characterize all connected graphs
with
A Predictive Model Which Uses Descriptors of RNA Secondary Structures Derived from Graph Theory.
The secondary structures of ribonucleic acid (RNA) have been successfully modeled with graph-theoretic structures. Often, simple graphs are used to represent secondary RNA structures; however, in this research, a multigraph representation of RNA is used, in which vertices represent stems and edges represent the internal motifs. Any type of RNA secondary structure may be represented by a graph in this manner. We define novel graphical invariants to quantify the multigraphs and obtain characteristic descriptors of the secondary structures. These descriptors are used to train an artificial neural network (ANN) to recognize the characteristics of secondary RNA structure. Using the ANN, we classify the multigraphs as either RNA-like or not RNA-like. This classification method produced results similar to other classification methods. Given the expanding library of secondary RNA motifs, this method may provide a tool to help identify new structures and to guide the rational design of RNA molecules