EuDML | Browse

Previous Page 19

Displaying 361 – 363 of 363

Extremely primitive groups and linear spaces

Haiyan Guan, Shenglin Zhou (2016)

Czechoslovak Mathematical Journal

A non-regular primitive permutation group is called extremely primitive if a point stabilizer acts primitively on each of its nontrivial orbits. Let $𝒮$ be a nontrivial finite regular linear space and $G \leq Aut (𝒮) .$ Suppose that $G$ is extremely primitive on points and let rank $(G)$ be the rank of $G$ on points. We prove that rank $(G) \geq 4$ with few exceptions. Moreover, we show that $Soc (G)$ is neither a sporadic group nor an alternating group, and $G = PSL (2, q)$ with $q + 1$ a Fermat prime if $Soc (G)$ is a finite classical simple group.

Extremizing algebraic connectivity subject to graph theoretic constraints.

Fallat, Shaun, Kirkland, Steve (1998)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Extremum degree sets of irregular oriented graphs and pseudodigraphs

Zyta Dziechcińska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzisław Skupień (2006)

Discussiones Mathematicae Graph Theory

A digraph in which any two vertices have distinct degree pairs is called irregular. Sets of degree pairs for all irregular oriented graphs (also loopless digraphs and pseudodigraphs) with minimum and maximum size are determined. Moreover, a method of constructing corresponding irregular realizations of those sets is given.

Displaying 361 – 363 of 363

Extremely primitive groups and linear spaces

Extremizing algebraic connectivity subject to graph theoretic constraints.

Extremum degree sets of irregular oriented graphs and pseudodigraphs

Currently displaying 361 – 363 of 363