Related papers: More on Numbers and Graphs
This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi…
We begin by introducing an extension of the traditional abundancy index to imaginary quadratic rings with unique factorization. After showing that many of the properties of the traditional abundancy index continue to hold in our extended…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…
The paper by M. Baker and S. Norine in 2007 introduced a new parameter on configurations of graphs and gave a new result in the theory of graphs which has an algebraic geometry flavour. This result was called Riemann-Roch formula for graphs…
We prove that the quantum graph algebra and the quantum moduli algebra associated to a punctured sphere and complex semisimple Lie algebra $\mathfrak{g}$ are Noetherian rings and finitely generated rings over $\mathbb{C}(q)$. Moreover, we…
The Stirling number of a simple graph is the number of partitions of its vertex set into a specific number of non-empty independent sets. In 2015, Engbers et al. showed that the coefficients in the normal ordering of a word $w$ in the…
A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
For a finite group $G$, the proper power graph $\mathscr{P}^*(G)$ of $G$ is the graph whose vertices are non-trivial elements of $G$ and two vertices $u$ and $v$ are adjacent if and only if $u \neq v$ and $u^m=v$ or $v^m=u$ for some…
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…
We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
Let $\mathbb{F}_q$ be the finite field with $q$ elements and $char(\mathbb{F}_q)$ odd. In this article we will describe completely the dynamics of the map $f(X)=c(X^{q+1}+aX^2)$, for $a=\{\pm1\}$ and $c\in\mathbb{F}_q^*$, over the finite…
We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.
Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…
For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…