Live briefing
Everything about Complement graph
Graph with same nodes as but complementary connections to another
In the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices are adjacent (connected) in H if and only if they are not adjacent in G. That is, to generate the complement of a graph, one fills in all the missing edges required to form a complete graph, and removes all the edges that were previously there. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Complement graphA 5-minute orientation
- Skim a recent paper: ACGNet: Action Complement Graph Network for Weakly-Supervised Temporal Action LocalizationInfluential work since 2022
- Pick up a classic book: Topics in Hyperplane ArrangementsThe most-reprinted book on the subject
- Read the landmark paper: Complex brain networks: graph theoretical analysis of structural and functional systemsCited 10,598 times
- Go sideways: CographA closely related topic
- Go sideways: Induced subgraphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Complex brain networks: graph theoretical analysis of structural and functional systems
MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph
Reversed graph embedding resolves complex single-cell trajectories
Learning Entity and Relation Embeddings for Knowledge Graph Completion
From time series to complex networks: The visibility graph
🆕 Influential since 2022
ACGNet: Action Complement Graph Network for Weakly-Supervised Temporal Action Localization
The Y-Index of Some Complement Graph Structures and Their Applications of Nanotubes and Nanotorus
The number of spanning trees in $$K_n$$-complement of a bipartite graph
A New Construction of Strongly Regular Graphs with Parameters of the Complement Symplectic Graph
Enhancing downstream tasks in Knowledge Graphs Embeddings: A Complement Graph-based Approach Applied to Bilateral Trade
📚 Books worth reading
- 📕Topics in Hyperplane ArrangementsMarcelo Aguiar, Swapneel Mahajan · 2017
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Cograph 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…
- Induced subgraph In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges from the original…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Perfect graph 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…
- Trivially perfect graph In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals…
- Split graph In graph theory, a branch of mathematics, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split…
- Clique cover In graph theory, a clique cover or partition into cliques of a given undirected graph is a collection of cliques that cover the whole graph. Generally…
- Comparability graph In graph theory and order theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial…