Related papers: Form uniqueness for graphs with weakly spherically…
We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…
The principles behind the sharp, singular structures in a crumpled sheet are well understood. Here we discuss more general ways of exploiting such sharp structures to control the shape of a sheet by deforming or forcing it elsewhere. Often,…
By a symmetric double graph we mean a hypersurface which is mirror-symmetric and the two symmetric parts are graphs over the hyperplane of symmetry. We prove that there is a weak solution of mean curvature flow that preserves these…
This paper presents an exhaustive approach for verification of the weak reconstruction of Self Complementary Graphs up to 17 vertices. It describes the general problem of the Reconstruction Conjecture, explaining the complexity involved in…
A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix…
The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they…
Given a simple graph $G$, the artinian monomial algebra associated to $G$, denoted by $A(G)$, is defined by the edge ideal of $G$ and the squares of the variables. In this article, we classify some tadpole graphs $G$ for which $A(G)$ has or…
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…
Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs, graph feature representation is required. A good…
In~\cite{bgs2013}, exclusion sensitivity and exclusion stability for symmetric exclusion processes on graphs were defined as a natural analogue of noise sensitivity and noise stability in this setting. As these concepts were defined for any…
Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
We investigate properties of signed graphs that have few distinct eigenvalues together with a symmetric spectrum. Our main contribution is to determine all signed $(0,2)$-graphs with vertex degree at most $6$ that have precisely two…
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
Praeger-Xu graphs are connected, symmetric, 4-regular graphs that are unusual both in that their automorphism groups are large, and in that vertex stabilizer subgroups are also large. Determining number and distinguishing number are…
Graphs triangulating the $2$-sphere are generically rigid in $3$-space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset $A$ in $3$-space so that the vertices of each graph $G$ as above can be mapped into $A$ to…
A family of graphs is called degenerate if it contains at least one bipartite graph. In this paper, we investigate the spectral extremal problems for a degenerate family of graphs $\mathcal{F}$. By employing covering and independent…