Related papers: On the Characteristic Polynomial of Skew Gain Grap…
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of…
Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$,…
A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…
A mixed extension of a graph $G$ is a graph $H$ obtained from $G$ by replacing each vertex of $G$ by a clique or a coclique, where vertices of $H$ coming from different vertices of $G$ are adjacent if and only if the original vertices are…
An oriented graph $G^\sigma$ is a digraph without loops or multiple arcs whose underlying graph is $G$. Let $S\left(G^\sigma\right)$ be the skew-adjacency matrix of $G^\sigma$ and $\alpha(G)$ be the independence number of $G$. The rank of…
In this paper we study the inverse eigenvector centrality problem on directed graphs: given a prescribed node centrality profile, we seek edge weights that realize it. Since this inverse problem generally admits infinitely many solutions,…
We address a prime counting problem across the homology classes of a graph, presenting a graph-theoretical Dirichlet-type analogue of the prime number theorem. The main machinery we have developed and employed is a spectral antisymmetry…
We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…
In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…
Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by additionally making use of graph structure based on the relational inductive bias (edge bias), rather than treating the nodes as collections of independent and identically…
This paper follows cognitive studies to investigate a graph representation for sketches, where the information of strokes, i.e., parts of a sketch, are encoded on vertices and information of inter-stroke on edges. The resultant graph…
In this paper, matching pairs of random graphs under the community structure model is considered. The problem emerges naturally in various applications such as privacy, image processing and DNA sequencing. A pair of randomly generated…
Flip graphs are graphs on combinatorial objects in which the adjacency relation reflects a local change in the underlying objects. In this thesis we introduce Yoke graphs, a family of flip graphs that generalizes previously studied families…
The inversion formula is given for automorphisms of the Weyl algebras with polynomial coefficients over a field of characteristic zero. The theorem of Gabber on the degree of polynomial automorphism is extended. It is proved that any…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…