Homogeneous graph
In mathematics, a k-ultrahomogeneous graph is a graph in which every isomorphism between two of its induced subgraphs of at 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 isomorphism between two induced subgraphs implies the existence of an automorphism of the whole graph that maps one subgraph to the other (but does not necessarily extend the given isomorphism). A homogeneous graph is a graph that is k-homogeneous for every k, or equivalently k-ultrahomogeneous for every k.
Wikipage redirect
primaryTopic
Homogeneous graph
In mathematics, a k-ultrahomogeneous graph is a graph in which every isomorphism between two of its induced subgraphs of at 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 isomorphism between two induced subgraphs implies the existence of an automorphism of the whole graph that maps one subgraph to the other (but does not necessarily extend the given isomorphism). A homogeneous graph is a graph that is k-homogeneous for every k, or equivalently k-ultrahomogeneous for every k.
has abstract
In mathematics, a k-ultrahomog ...... -ultrahomogeneous for every k.
@en
Wikipage page ID
34,035,216
page length (characters) of wiki page
Wikipage revision ID
988,842,269
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In mathematics, a k-ultrahomog ...... -ultrahomogeneous for every k.
@en
label
Homogeneous graph
@en