About: Cluster graph

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In graph theory, a branch of mathematics, a cluster graph is a graph formed from the disjoint union of complete graphs.Equivalently, a graph is a cluster graph if and only if it has no three-vertex induced path; for this reason, the cluster graphs are also called P3-free graphs. They are the complement graphs of the complete multipartite graphs and the 2-leaf powers. The cluster graphs are transitively closed, and every transitively closed undirected graph is a cluster graph.

Property	Value
dbo:abstract	In graph theory, a branch of mathematics, a cluster graph is a graph formed from the disjoint union of complete graphs.Equivalently, a graph is a cluster graph if and only if it has no three-vertex induced path; for this reason, the cluster graphs are also called P3-free graphs. They are the complement graphs of the complete multipartite graphs and the 2-leaf powers. The cluster graphs are transitively closed, and every transitively closed undirected graph is a cluster graph. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/Equivalentie.svg?width=300
dbo:wikiPageID	50931136 (xsd:integer)
dbo:wikiPageLength	5296 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1095082294 (xsd:integer)
dbo:wikiPageWikiLink	dbc:Graph_families dbc:Perfect_graphs dbr:Induced_path dbr:Induced_subgraph dbr:Complete_graph dbr:Countably_infinite dbr:Mathematics dbr:Maximal_independent_set dbr:Graph_(discrete_mathematics) dbr:Multipartite_graph dbr:NP-complete dbr:Claw-free_graph dbr:Complement_graph dbr:Transitive_closure dbr:Well-covered_graph dbr:Disjoint_union_of_graphs dbr:Leaf_power dbr:Graph_automorphism dbr:Graph_isomorphism dbr:Graph_theory dbr:Block_graph dbr:Cograph dbr:Homogeneous_graph dbr:If_and_only_if dbr:Neighborhood_(graph_theory) dbr:Diamond-free_graph dbr:Parameterized_complexity dbr:Subcoloring dbr:Turán_graph dbr:Cluster_editing dbr:File:Equivalentie.svg
dbp:wikiPageUsesTemplate	dbt:About dbt:Math dbt:Reflist dbt:Short_description dbt:Sub
dcterms:subject	dbc:Graph_families dbc:Perfect_graphs
rdfs:comment	In graph theory, a branch of mathematics, a cluster graph is a graph formed from the disjoint union of complete graphs.Equivalently, a graph is a cluster graph if and only if it has no three-vertex induced path; for this reason, the cluster graphs are also called P3-free graphs. They are the complement graphs of the complete multipartite graphs and the 2-leaf powers. The cluster graphs are transitively closed, and every transitively closed undirected graph is a cluster graph. (en)
rdfs:label	Cluster graph (en)
owl:sameAs	yago-res:Cluster graph wikidata:Cluster graph dbpedia-hu:Cluster graph https://global.dbpedia.org/id/2M8j2
prov:wasDerivedFrom	wikipedia-en:Cluster_graph?oldid=1095082294&ns=0
foaf:depiction	wiki-commons:Special:FilePath/Equivalentie.svg
foaf:isPrimaryTopicOf	wikipedia-en:Cluster_graph
is dbo:wikiPageWikiLink of	dbr:Multipartite_graph dbr:Clique_(graph_theory) dbr:Cluster_diagram dbr:Component_(graph_theory) dbr:Clique_graph_(disambiguation) dbr:Transitive_closure dbr:Well-covered_graph dbr:Disjoint_union_of_graphs dbr:Block_graph dbr:Cograph dbr:Homogeneous_graph dbr:Diamond_graph dbr:Strongly_chordal_graph dbr:Subcoloring
is foaf:primaryTopic of	wikipedia-en:Cluster_graph