- also
regular is
called biregular, and the
biregular maps are the
isomorphisms of
algebraic varieties.
Because regular and
biregular are very restrictive...
- In graph-theoretic mathematics, a
biregular graph or
semiregular bipartite graph is a
bipartite graph G = ( U , V , E ) {\displaystyle G=(U,V,E)} for...
- in the graph. In particular, both
subsets have
equal degree sums. For
biregular graphs, with a
partition of the
vertices into
subsets V 1 {\displaystyle...
-
abstract incidence structure. Levi
graphs of
configurations are
biregular, and
every biregular graph with
girth at
least six can be
viewed as the Levi graph...
-
sense that the
inverse map
exists and is
regular – the
Veronese map is
biregular. More precisely, the
images of open sets in the
Zariski topology are again...
-
hence can be
colored with only two colors), and
either semi-symmetric or
biregular.
Examples of edge but not
vertex transitive graphs include the complete...
-
General position is
preserved under biregular maps – if
image points satisfy a relation, then
under a
biregular map this
relation may be
pulled back...
-
colorable graph G on n
vertices t(G)≤(11/6)n. A
bipartite graph is (a, b)-
biregular if
everyvertex in one part has
degree a and
every vertex in the other...
- edge-transitive and
regular → edge-transitive ↓ ↓ ↓ vertex-transitive →
regular → (if bipartite)
biregular ↑
Cayley graph ← zero-symmetric asymmetric...
- side of the
bipartition as each
other have the same
degree is
called a
biregular graph. An undirected,
connected graph has an
Eulerian path if and only...
