Related papers: On graphs and valuations

Let Z_n be the finite commutative ring of residue classes modulo n and Gamma(Z_n) be its zero-divisor graph. The nilradical graph and non-nilradical graph of Z_n are denoted by N(Z_n) and Omega(Z_n) respectively. In 2012, Haynes et al. [5]…

For a graph G, the k-total dominating graph D_{k}^{t}(G) is the graph whose vertices correspond to the total dominating sets of G that have cardinality at most k; two vertices of D_{k}^{t}(G) are adjacent if and only if the corresponding…

S. Alesker has shown that if $G$ is a compact subgroup of O(n) acting transitively on the unit sphere $S^{n-1}$ then the vector space $Val^G$ of continuous, translation-invariant, $G$-invariant convex valuations on $R^n$ has the structure…

Let $V$ be a finite set. Let $\mathcal{K}$ be a simplicial complex with its vertices in $V$. In this paper, we discuss some differential calculus on $V$. We construct some constrained homology groups of $\mathcal{K}$ by using the…

We propose a novel score-based approach to learning a directed acyclic graph (DAG) from observational data. We adapt a recently proposed continuous constrained optimization formulation to allow for nonlinear relationships between variables…

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

For a certain field $K$, we construct a valuation-algebraic valuation on the polynomial ring $K[x]$, whose Maclane--Vaqui\'e chain consists of an infinite (countable) number of limit augmentations

The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

Zero-divisor graphs of commutative rings are well-represented in the literature. In this paper, we consider dominating sets, total dominating sets, domination numbers and total domination numbers of zero-divisor graphs. We determine the…

We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.

Let $R$ be a commutative ring with identity. We introduce a novel bipartite graph $\mathcal{B}(R)$, the \textit{bipartite zero-divisor--unit graph}, whose vertex set is the disjoint union of the nonzero zero-divisors $Z(R)^*$ and the unit…

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. In particular, our approach…

We work with rational rank 1 valuations centered in regular local rings. Given an algebraic function field $K$ of transcendence degree 3 over $k$, a regular local ring $R$ with $QF(R)=K$ and a $k$-valuation $\nu$ of $K$, we provide an…

As more and more network-structured data sets are available, the statistical analysis of valued graphs has become common place. Looking for a latent structure is one of the many strategies used to better understand the behavior of a…

Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…

It is challenging for generative models to learn a distribution over graphs because of the lack of permutation invariance: nodes may be ordered arbitrarily across graphs, and standard graph alignment is combinatorial and notoriously…