The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades. Along these lines various zero forcing parameters have been devised and utilized for bounding the maximum nullity. The maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing a variety of specific properties are analysed. Building upon earlier work, where connections to the minimum rank of line graphs were established, we verify analogous equations in the positive semidefinite cases and coincidences with the corresponding zero forcing numbers. Working beyond the case of trees, we study the zero forcing number of line graphs associated with certain families of unicyclic graphs., Shaun Fallat, Abolghasem Soltani., and Obsahuje seznam literatury
In this paper we consider the following problem: Over the class of all simple connected unicyclic graphs on $n$ vertices with girth $g$ ($n$, $g$ being fixed), which graph minimizes the Laplacian spectral radius? Let $U_{n,g}$ be the lollipop graph obtained by appending a pendent vertex of a path on $n-g$ $(n> g)$ vertices to a vertex of a cycle on $g\geq 3$ vertices. We prove that the graph $U_{n,g}$ uniquely minimizes the Laplacian spectral radius for $n\geq 2g-1$ when $g$ is even and for $n\geq 3g-1$ when $g$ is odd.
E. Prisner in his book Graph Dynamics defines the k-path-step operator on the class of finite graphs. The k-path-step operator (for a positive integer k) is the operator S' k which to every finite graph G assigns the graph S' k(G) which has the same vertex set as G and in which two vertices are adjacent if and only if there exists a path of length k in G connecting them. In the paper the trees and the unicyclic graphs fixed in the operator S' 3 are studied.
A graph is nonsingular if its adjacency matrix $A(G)$ is nonsingular. The inverse of a nonsingular graph $G$ is a graph whose adjacency matrix is similar to $A(G)^{-1}$ via a particular type of similarity. Let $\mathcal{H}$ denote the class of connected bipartite graphs with unique perfect matchings. Tifenbach and Kirkland (2009) characterized the unicyclic graphs in $\mathcal{H}$ which possess unicyclic inverses. We present a characterization of unicyclic graphs in $\mathcal{H}$ which possess bicyclic inverses., Swarup Kumar Panda., and Obsahuje bibliografii