相关论文: Controllable Subsets in Graphs

A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…

A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths…

A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent…

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

The problem of leaders location plays an important role in the controllability of undirected graphs.The concept of minimal perfect critical vertex set is introduced by drawing support from the eigenvector of Laplace matrix. Using the notion…

Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…

We present complexity results regarding a matching-type problem related to structural controllability of dynamical systems modelled on graphs. Controllability of a dynamical system is the ability to choose certain inputs in order to drive…

Given a graph G equals (V,E), a subset S subset of V is a dominating set if every vertex in V minus S is adjacent to some vertex in S. The dominating set with the least cardinality, gamma, is called a gamma-set which is commonly known as a…

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…

An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…

We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding…

A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. It is well known that a graph $G$ has exactly two main eigenvalues if and only if there exists a unique pair of…

Observability of an array of identical LTI systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is…

A vertex subset $S$ in a graph $G$ is a dominating set if every vertex not contained in $S$ has a neighbor in $S$. A dominating set $S$ is a connected dominating set if the subgraph $G[S]$ induced by $S$ is connected. A connected dominating…

We consider a finite, connected and simple graph $\Gamma$ that admits a vertex-transitive group of automorphisms $G$. Under the assumption that, for all $x \in V(\Gamma)$, the local action $G_x^{\Gamma(x)}$ is the action of…