Related papers: On the orientation of graphs

The 2-domination number $\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \gamma_2(G) $ cannot be smaller…

Let $A$ be a finite group acting by automorphisms on the finite group $G$. We introduce the commuting graph $\Gamma (G,A)$ of this action and study some questions related to the structure of $G$ under certain graph theoretical conditions on…

A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…

In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…

Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and…

This paper investigates the relations between modular graph forms, which are generalizations of the modular graph functions that were introduced in earlier papers motivated by the structure of the low energy expansion of genus-one Type II…

We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A related problem is to find representations for multiple…

In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…

Let $\Gamma$ denote a finite, simple and connected graph. Fix a vertex $x$ of $\Gamma$ which is not a leaf and let $T=T(x)$ denote the Terwilliger algebra of $\Gamma$ with respect to $x$. Assume that the unique irreducible $T$-module with…

We present a construction, which assigns two groupoids, $\Gugamma$ and $\Gmgamma$, to an inverse semigroup $\Gamma$. By definition, $\Gmgamma$ is a subgroupoid (even a reduction) of $\Gugamma$. The construction unifies known constructions…

A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…

Let $\Gamma$ be a chart, and we denote by $\Gamma_m$ the union of all the edges of label $m$. A chart $\Gamma$ is of type $(2,3,2)$ if there exists a label $m$ such that $w(\Gamma)=7$, $w(\Gamma_m\cap\Gamma_{m+1})=2$,…

$\Gamma$-symmetric spaces are a vast generalization of symmetric spaces. Previous results make it conceivable that their isotropy action is equivariantly formal, and we provide evidence for this in case that $\Gamma =…

Let $\Gamma$ be a chart, and we denote by $\Gamma_m$ the union of all the edges of label $m$. A chart $\Gamma$ is of type $(m;2,3,2)$ if $w(\Gamma)=7$, $w(\Gamma_m\cap\Gamma_{m+1})=2$, $w(\Gamma_{m+1}\cap\Gamma_{m+2})=3$, and…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two…

The $\gamma$-graph of a graph $G$ is the graph whose vertices are labelled by the minimum dominating sets of $G$, in which two vertices are adjacent when their corresponding minimum dominating sets (each of size $\gamma(G)$) intersect in a…

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

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…