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...
5 KB (543 words) - 19:54, 29 May 2021
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...
11 KB (1,158 words) - 12:55, 15 May 2023
Edge-transitive graph Lovász conjecture Semi-symmetric graph Zero-symmetric graph Godsil, Chris; Royle, Gordon (2013) [2001], Algebraic Graph Theory, Graduate...
6 KB (636 words) - 22:09, 26 January 2024
Laplacian matrix (redirect from Kirchhoff matrix (of a graph))
each column sums to zero since A D + {\displaystyle AD^{+}} is left stochastic. For a non-symmetric adjacency matrix of a directed graph, one also needs to...
43 KB (4,940 words) - 17:25, 24 March 2024
Adjacency matrix (redirect from Adjacency matrix of a bipartite graph)
matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory....
20 KB (2,445 words) - 14:00, 24 April 2024
In graph theory, a branch of mathematics, a skew-symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by...
17 KB (2,318 words) - 00:04, 30 April 2024
regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever λ = 1. A strongly regular graph is...
20 KB (3,355 words) - 16:56, 17 June 2024
mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes...
5 KB (516 words) - 07:27, 6 March 2024
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...
5 KB (535 words) - 18:16, 1 May 2023
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...
29 KB (4,690 words) - 21:09, 11 May 2024
maximum size of the graph is n(n − 1)/2. The edges of an undirected simple graph permitting loops G {\displaystyle G} induce a symmetric homogeneous relation...
52 KB (6,403 words) - 06:09, 18 June 2024
called loop-digraphs (see section Types of directed graph). Symmetric directed graphs are directed graphs where all edges appear twice, one in each direction...
16 KB (1,936 words) - 16:53, 23 June 2024
families of graphs based on symmetry (such as symmetric graphs, vertex-transitive graphs, edge-transitive graphs, distance-transitive graphs, distance-regular...
7 KB (671 words) - 16:56, 27 November 2023
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...
5 KB (488 words) - 06:36, 5 June 2024
Eulerian path (redirect from Eulerian graph)
and symmetric are guaranteed to be Eulerian. However, this is not a necessary condition, as it is possible to construct a non-symmetric, even graph that...
27 KB (3,269 words) - 06:54, 4 May 2024
the Petersen graph has non-orientable genus 1. The Petersen graph is strongly regular (with signature srg(10,3,0,1)). It is also symmetric, meaning that...
24 KB (2,926 words) - 19:05, 30 April 2024
In the mathematical field of graph theory, the Möbius–Kantor graph is a symmetric bipartite cubic graph with 16 vertices and 24 edges named after August...
13 KB (1,512 words) - 19:59, 8 January 2024
{\displaystyle 2k} nonzero eigenvalues. Note that the (simple) graph of a real symmetric or skew-symmetric matrix A {\displaystyle A} of order n {\displaystyle...
23 KB (2,938 words) - 20:01, 24 May 2024
graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...
67 KB (7,996 words) - 05:55, 18 June 2024
dual graph is symmetric, meaning that if H is a dual of a connected graph G, then G is a dual of H. When discussing the dual of a graph G, the graph G itself...
51 KB (6,580 words) - 02:26, 3 January 2024
products: Symmetric groups – The symmetric group Sn contains, for any group of order n, a subgroup isomorphic to that group. Thus the cycle graph of every...
21 KB (2,007 words) - 21:40, 19 May 2024
Logarithmic scale (redirect from Logarithmic graph paper)
for negative input (y<0) to avoid the singularity for zero input (y=0), and so produce symmetric log plots: Y = sgn ( y ) ⋅ log 10 ( 1 + | y / C |...
13 KB (1,192 words) - 01:30, 19 April 2024
For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set. The symmetric group is important to diverse areas of...
46 KB (6,130 words) - 06:34, 24 May 2024
one vertex and zero edges. More generally, a component of this type is formed for every isolated vertex in any graph. In a connected graph, there is exactly...
30 KB (3,423 words) - 05:54, 12 January 2024
Hypergraph (redirect from Host graph)
describe properties of line-symmetric graphs. Note the obvious but important observation that every line-symmetric graph is line-regular. Karypis, G....
47 KB (6,289 words) - 21:53, 8 March 2024
the OEIS) Edge-transitive graphs include all symmetric graph, such as the vertices and edges of the cube. Symmetric graphs are also vertex-transitive...
5 KB (515 words) - 08:29, 18 August 2023
Symmetry in mathematics (section Symmetric groups)
fields of characteristic zero, the graded vector space of all symmetric tensors can be naturally identified with the symmetric algebra on V. A related...
22 KB (2,837 words) - 01:51, 8 February 2023
real functions whose graph is self-symmetric with respect to the y-axis, and odd functions are those whose graph is self-symmetric with respect to the...
16 KB (2,448 words) - 11:34, 21 June 2024
Rose (mathematics) (redirect from Rose graph)
equations coincident. Only certain roses are symmetric about the pole. Individual petals are symmetric about the line through the pole and the petal's...
22 KB (2,788 words) - 07:12, 2 December 2023
Second derivative (section Relation to the graph)
{f(x+h)-2f(x)+f(x-h)}{h^{2}}}.} The limit is called the second symmetric derivative. The second symmetric derivative may exist even when the (usual) second derivative...
15 KB (2,013 words) - 20:23, 29 April 2024