Given a graph H and a positive integer n, the planar Turan number of H, denoted by exp(n, H), is the maximum number of edges in an n-vertex H-free planar graph.D.Ghosh, et al.initiated the topic of double stars S_(k,l). Recently Xu et al.[AIMS Mathem...
Several attempts have been made at constructing Abstract Meaning Representations (AMRs) compositionally, and recently the idea of using s-graphs with the HR-algebra (Koller, 2015) has been simplified to reduce the number of options when parsing (Gros...
Flow graph may refer to: Flow or rooted graph (graph theory), a graph in which a vertex has been distinguished as the root Control-flow graph (computer
An input to the Popular Matching problem, in the roommates setting, consists of a graph $G$ and each vertex ranks its neighbors in strict order, known as its preference. In the Popular Matching problem the objective is to test whether there exists a...
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition graphs hav...
Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity character degre...
A subgraph $G'$ of a graph $G$ is nice if $G-V(G')$ has a perfect matching. Nice subgraphs play a vital role in the theory of ear decomposition and matching minors of matching covered graphs. A vertex $u$ of a cubic graph is nice if $u$ and its neigh...
OpenGL text using one vertex buffer, one texture and FreeType (⭐ 1740)
Let $\mathcal{O}_{25}$ be the vertex algebraic braided tensor category of finite-length modules for the Virasoro Lie algebra at central charge $25$ whose composition factors are the irreducible quotients of reducible Verma modules. We show that $\mat...
In hep-th/0010293 Kapustin and Orlov introduce the notion of an OPE-algebra and propose that it formalizes conformal field theories in the same way as vertex algebras formalize chiral algebras, i.e. the subalgebras of holomorphic fields of conforma...
\noindent A perfect dominating set in a graph $G=(V,E)$ is a subset $S \subseteq V$ such that each vertex in $V \setminus S$ has exactly one neighbor in $S$. A perfect coalition in $G$ consists of two disjoint sets of vertices $V_i$ and $V_j$ such th...
For a graph $G=(V,E)$, a pair of vertex disjoint sets $A_{1}$ and $A_{2}$ form a connected coalition of $G$, if $A_{1}\cup A_{2}$ is a connected dominating set, but neither $A_{1}$ nor $A_{2}$ is a connected dominating set. A connected coalition part...
Let $G$ be graph with vertex set $V$ and order $n=|V|$. A coalition in $G$ is a combination of two distinct sets, $A\subseteq V$ and $B\subseteq V$, which are disjoint and are not dominating sets of $G$, but $A\cup B$ is a dominating set of $G$. A co...
Let $G$ be a graph with vertex set $V$ and of order $n = |V|$, and let $δ(G)$ and $Δ(G)$ be the minimum and maximum degree of $G$, respectively. Two disjoint sets $V_1, V_2 \subseteq V$ form a coalition in $G$ if none of them is a dominating set of...
Let $G$ be graph with vertex set $V(G)$ and order $n$. A coalition in a graph $G$ consists of two disjoint sets of vertices $V_1$ and $V_2$, neither of which is a dominating set but whose union $V_1 \cup V_2$ is a dominating set. A coalition partitio...
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally silver graph is a graph which admits a totally silver coloring. Total...
The niche graph of a digraph $D$ has $V(D)$ as the vertex set and an edge $uv$ if and only if $(u,w) \in A(D)$ and $(v,w) \in A(D)$, or $(w,u) \in A(D)$ and $(w,v) \in A(D)$ for some $w \in V(D)$. The notion of niche graph was introduced by Cable et...
Let $G_{n,p}^{[κ]}$ denote the space of $n$-vertex edge coloured graphs, where each edge occurs independently with probability $p$. The colour of each existing edge is chosen independently and uniformly at random from the set $[κ]$. We consider the...
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A $\textit{streamed graph}$ is a stream of edges $e_1,e_2,...,e_m$ on a vertex set $V$. A streamed graph is $ω$-$\textit{stream planar}$ with resp...
We show that the wreath Macdonald polynomials for $\mathbb{Z}/\ell\mathbb{Z}\wrΣ_n$, when naturally viewed as elements in the vertex representation of the quantum toroidal algebra $U_{\mathfrak{q},\mathfrak{d}}(\ddot{\mathfrak{sl}}_\ell)$, diagonali...