Live briefing
Everything about Split graph
Graph which partitions into a clique and independent set
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 graphs were first studied by Földes and Hammer, and independently introduced by Tyshkevich and Chernyak, where they called these graphs "polar graphs". Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Split graphA 5-minute orientation
- Skim a recent paper: Split Depth-Wise Separable Graph-Convolution Network for Road Extraction in Complex Environments From High-Resolution Remote-Sensing ImagesInfluential work since 2022
- Pick up a classic book: Introduction to Quiver RepresentationsThe most-reprinted book on the subject
- Read the landmark paper: The regional oceanic modeling system (ROMS): a split-explicit, free-surface, topography-following-coordinate oceanic modelCited 4,570 times
- Go sideways: Distance-hereditary graphA closely related topic
- Go sideways: Trivially perfect graphA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The regional oceanic modeling system (ROMS): a split-explicit, free-surface, topography-following-coordinate oceanic model
Split-spectrum amplitude-decorrelation angiography with optical coherence tomography
Combining knowledge graph into metro passenger flow prediction: A split-attention relational graph convolutional network
Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm
Merge-and-Split Graph Convolutional Network for Skeleton-Based Interaction Recognition
When is the Comaximal Graph Split?
Complete split graph determined by its (signless) Laplacian spectrum
Deep Residual Split Directed Graph Convolutional Neural Networks for Action Recognition
🆕 Influential since 2022
Split Depth-Wise Separable Graph-Convolution Network for Road Extraction in Complex Environments From High-Resolution Remote-Sensing Images
Siamese Graph Convolutional Split-Attention Network with NLP based Social Sentimental Data for enhanced stock price predictions
Design of all-wheel-drive power-split hybrid configuration schemes based on hierarchical topology graph theory
A split–merge clustering algorithm based on the k-nearest neighbor graph
Rotary Machinery Fault Diagnosis Based on Split Attention Mechanism and Graph Convolutional Domain Adaptive Adversarial Network
đź“š Books worth reading
- 📕Introduction to Quiver RepresentationsHarm Derksen, Jerzy Weyman · 2018
- 📕Quiver Representations and Quiver VarietiesAlexander Kirillov · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Distance-hereditary graph In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances…
- 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…
- 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…
- 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…
- Perfect graph theorem In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph…
- 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…
- Permutation graph In the mathematical field of graph theory, a permutation graph is a graph whose vertices represent the elements of a permutation, and whose edges represent…
- Chordal bipartite graph In the mathematical area of graph theory, a chordal bipartite graph is a bipartite graph B = (X,Y,E) in which every cycle of length at least 6 in B has…