Related papers: Double graph complex and characteristic classes of…
Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…
In this paper, we give a new algebraic criterion for the {\em shellability} of (non-pure) simplicial complex $\Delta$ over $[n]$, shellable in the sense of Bj\"orner and Wachs \cite{BW}. We show that the spanning simplicial complex of…
We define a family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to constants) isoperimetric inequality for dual systolic graphs.…
What are called secondary characteristic classes in Chern-Weil theory are a refinement of ordinary characteristic classes of principal bundles from cohomology to differential cohomology. We consider the problem of refining the construction…
Dynamical systems with a network structure can display collective behaviour such as synchronisation. Golubitsky and Stewart observed that all the robustly synchronous dynamics of a network is contained in the dynamics of its quotient…
Symplectic Lefschetz fibrations can be described via classifying maps with values in the Deligne-Mumford compactification of the moduli space of curves, by means of constructions relying on symplectic geometry. In this note we prove the…
Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
We consider a bi-Lagrangian manifold $(M,\omega,\mathcal{F}_{1},\mathcal{F}_{2})$. That is, $\omega$ is a 2-form, closed and non-degenerate (called symplectic form) on $M$, and $(\mathcal{F}_{1},\mathcal{F}_{2})$ is a pair of transversal…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
In this paper, we continue the classification work done in the first paper of the same name. With careful modifications of our previous approach, we are able to deduce (with two notable exceptions) which members of the previously introduced…
When $\mathcal{C}$ is a chordal clutter in the sense of Woodroofe or Emtander, we show that the complement clutter is edgewise strongly shellable. When $\mathcal{C}$ is indeed a finite simple graph, we study various characterizations of…
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
In this brief communication, we investigate the cospectral as well integral chain graphs for Seidel matrix, a key component to study the structural properties of equiangular lines in space. We derive a formula that allows to generate an…
We observe that the notion of a trivial Serre fibration, a Serre fibration, and being contractible, for finite CW complexes, can be defined in terms of the Quillen lifting property with respect to a single map M-->/\ of finite topological…
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…
The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…
In this paper we completely characterize the graphs which have an edge weighted adjacency matrix belonging to the class of $n \times n$ involutions with spectrum equal to $\{ \lambda_1^{n-2}, \lambda_2^{2} \}$ for some $\lambda_1$ and some…