most k vertices can be extended to an automorphism of the whole graph. A k-homogeneous graph obeys a weakened version of the same property in which every...

graph is locally comparable; every (k)-(ultra)-homogeneous graph is locally (k)-(ultra)-homogeneous. A graph is locally cyclic if every neighbourhood is...

and y in the graph, and to a 1 in the square matrix of R. It is called an adjacency matrix in graph terminology. Some particular homogeneous relations over...

whole graph. With only two exceptions, the cluster graphs and their complements are the only finite homogeneous graphs, and infinite cluster graphs also...

ring Homogeneous equation (linear algebra): systems of linear equations with zero constant term Homogeneous function Homogeneous graph Homogeneous (large...

In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some...

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 ∼...

the unique countable homogeneous graph that does not contain an i-vertex clique but that does contain all Ki-free finite graphs as induced subgraphs....

In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix, or discrete Laplacian...

concepts relating to the uniformity of a substance, process or image. A homogeneous feature is uniform in composition or character (i.e., color, shape, size...

to a homogeneous system, then the vector sum u + v is also a solution to the system. If u is a vector representing a solution to a homogeneous system...

In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...

Weisstein, Eric W. "Barnette-Bosák-Lederberg Graph". MathWorld. Grinberg, E. J. "Plane Homogeneous Graphs of Degree Three without Hamiltonian Circuits...

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...

v {\displaystyle \mathbf {v} } , each homogeneous vector p {\displaystyle \mathbf {p} } (written in homogeneous coordinates) can be multiplied by this...

A chart (sometimes known as a graph) is a graphical representation for data visualization, in which "the data is represented by symbols, such as bars...

one-degree polynomial above. Geometrically, the graph of the function must pass through the origin. Homogeneous function Nonlinear system Piecewise linear...

relations leans on graph theory: For relations on a set (homogeneous relations), a directed graph illustrates a relation and a graph a symmetric relation...

graph of the zero polynomial, f(x) = 0, is the x-axis. In the case of polynomials in more than one indeterminate, a polynomial is called homogeneous of...

cardinality continuum? Do the Henson graphs have the finite model property? Does a finitely presented homogeneous structure for a finite relational language...

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...

for homogeneous graphs, where there only exist one type of nodes and edges. However, the theory and methods for heterophily on heterogeneous graphs, temporal...

In graph theory, a rook's graph is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's...

(January 2019). "Constraint Satisfaction Problems for Reducts of Homogeneous Graphs". SIAM Journal on Computing. 48 (4): 1224–1264. arXiv:1602.05819....

complex cube root of 1. Euler–Gompertz constant Euler's homogeneous function theorem – A homogeneous function is a linear combination of its partial derivatives...

located in some region of space. The resulting point process is called a homogeneous or stationary Poisson point process. In the second case, the point process...

tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the...

automatically using graph drawing techniques. In some sources, the phrase "Hasse diagram" has a different meaning: the directed acyclic graph obtained from...

geometric graph theory, a unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane. That is, it is a graph with one vertex...

In mathematics, the transitive closure R+ of a homogeneous binary relation R on a set X is the smallest relation on X that contains R and is transitive...