Graphs with Projective Linear Stabilizers

Additive Stabilizers for Unstable Graphs

Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a network bargaining game with a balanced solution. A graph with weighted edges is called stable if the maximum weight of an integral matching equals the cost of a ...

Quartic half-arc-transitive graphs with large vertex stabilizers

A 1 2 -arc-transitive graph is a vertexand edgebut not arc-transitive graph. In all known constructions of quartic 1 2 -arc-transitive graphs, vertex stabilizers are isomorphic to Z 2,Z 2 2 or to D8. In this article, for each positive integer m ≥ 1, an infinite family of quartic 1 2 -arctransitive graphs having vertex stabilizers isomorphic to Z m

Projective-planar graphs with even duals

characterization of projective general linear groups

let $g$ be a finite group and $pi_{e}(g)$ be the set of element orders of $g $. let $k in pi_{e}(g)$ and $s_{k}$ be the number of elements of order $k $ in $g$. set nse($g$):=${ s_{k} | k in pi_{e}(g)}$. in this paper, it is proved if $|g|=|$ pgl$_{2}(q)|$, where $q$ is odd prime power and nse$(g)= $nse$($pgl$_{2}(q))$, then $g cong $pgl$_

Finding Small Stabilizers for Unstable Graphs

An undirected graph G = (V,E) is stable if its inessential vertices (those that are exposed by at least one maximum matching) form a stable set. We call a set of edges F ⊆ E a stabilizer if its removal from G yields a stable graph. In this paper we study the following natural edgedeletion question: given a graph G = (V,E), can we find a minimumcardinality stabilizer? Stable graphs play an impor...