without any fixed points. Skew-symmetric graphs are identical to the double covering graphs of bidirected graphs. Skew-symmetric graphs were first introduced...

Antisymmetric or skew-symmetric may refer to: Antisymmetry in linguistics Antisymmetry in physics Antisymmetric relation in mathematics Skew-symmetric graph Self-complementary...

real skew-symmetric matrices with graph G {\displaystyle G} have at most 2 k {\displaystyle 2k} nonzero eigenvalues. Note that the (simple) graph of a...

one edge to another, a symmetric graph must also be edge-transitive. However, an edge-transitive graph need not be symmetric, since a—b might map to...

A skew-symmetric graph is the double covering graph of a bidirected graph. A bidirected graph may be regarded as an orientation of a signed graph, similarly...

Infinite skew polyhedron Skew-symmetric graph Skew-symmetric matrix Skew tableau, a generalization of Young tableaux Skewness, a measure of the asymmetry...

is vertex-transitive and edge-transitive but not symmetric. A skew-symmetric graph is a directed graph together with a permutation σ on the vertices that...

distribution with zero value of skewness does not imply that this distribution is symmetric necessarily. However, a symmetric unimodal or multimodal distribution...

In the mathematical field of graph theory, a zero-symmetric graph is a connected graph in which each vertex has exactly three incident edges and, for...

Frucht graph and Tietze's graph). Finite vertex-transitive graphs include the symmetric graphs (such as the Petersen graph, the Heawood graph and the...

to be symmetric ( S = S − 1 {\displaystyle S=S^{-1}} ) and not containing the group identity element. In this case, the uncolored Cayley graph can be...

graph theory, a semi-symmetric graph is an undirected graph that is edge-transitive and regular, but not vertex-transitive. In other words, a graph is...

In mathematics the determinant of an m×m skew-symmetric matrix can always be written as the square of a polynomial in the matrix entries, a polynomial...

once to the given graph and a second time to its reversal. A skew-symmetric graph is a graph that is isomorphic to its own transpose graph, via a special...

In mathematical logic and graph theory, an implication graph is a skew-symmetric, directed graph G = (V, E) composed of vertex set V and directed edge...

families of graphs based on symmetry (such as symmetric graphs, vertex-transitive graphs, edge-transitive graphs, distance-transitive graphs, distance-regular...

\pm \lambda _{\frac {n}{2}}} . Note that the (simple) graph of a real symmetric or skew-symmetric matrix A {\displaystyle A} of order n {\displaystyle...

skewed cases, with successes s = {n/4}, show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions...

Read-once function Sheffer stroke Sole sufficient operator Symmetric Boolean function Symmetric difference Zhegalkin polynomial Boolean domain Complete Boolean...

and S is skew-symmetric (as is the normalized C if its first row is negated), or n is oddly even (congruent to 2 modulo 4) and S is symmetric (as is the...

implicative normal form of the instance. An implication graph must be a skew-symmetric graph, meaning that it has a symmetry that takes each variable...

In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers λ , μ ≥ 0...

A matrix that has only real entries is symmetric if and only if it is a Hermitian matrix. A real and symmetric matrix is simply a special case of a Hermitian...

Issai Schur, are certain symmetric polynomials in n variables, indexed by partitions, that generalize the elementary symmetric polynomials and the complete...

the OEIS) Edge-transitive graphs include all symmetric graph, such as the vertices and edges of the cube. Symmetric graphs are also vertex-transitive...

Goldberg, Andrew V.; Karzanov, Alexander V. (1996), "Path problems in skew-symmetric graphs", Combinatorica, 16 (3): 353–382, doi:10.1007/BF01261321, S2CID 16308467...

In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular...

other automorphisms. Note that the term "asymmetric graph" is not a negation of the term "symmetric graph," as the latter refers to a stronger condition than...

number of the Coxeter group. These polygons and projected graphs are useful in visualizing symmetric structure of the higher-dimensional regular polytopes...

A^{**}\subseteq A^{*}} for symmetric operators and A = A ∗ ∗ ⊆ A ∗ {\displaystyle A=A^{**}\subseteq A^{*}} for closed symmetric operators. The densely defined...