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

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

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

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

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

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

In graph theory, the Henson graph Gi is an undirected infinite graph, the unique countable homogeneous graph that does not contain an i-vertex clique...