Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Cograph and Disjoint union

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Cograph and Disjoint union

Cograph vs. Disjoint union

In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation and disjoint union. In set theory, the disjoint union (or discriminated union) of a family of sets is a modified union operation that indexes the elements according to which set they originated in.

Similarities between Cograph and Disjoint union

Cograph and Disjoint union have 1 thing in common (in Unionpedia): Disjoint union of graphs.

Disjoint union of graphs

In graph theory, a branch of mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph.

Cograph and Disjoint union of graphs · Disjoint union and Disjoint union of graphs · See more »

The list above answers the following questions

Cograph and Disjoint union Comparison

Cograph has 59 relations, while Disjoint union has 19. As they have in common 1, the Jaccard index is 1.28% = 1 / (59 + 19).

References

This article shows the relationship between Cograph and Disjoint union. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »