Threshold Graph Checker

isolated + dominating build

All Tools

Loading tool...

About Threshold Graph Checker

A threshold graph checker testing if G can be built by iteratively adding isolated vertices (degree 0) or dominating vertices (adjacent to all existing). Threshold ⊂ split ⊂ chordal. Degree sequence uniquely determines threshold graph. O(n+m). Client-side.

Threshold Graph Checker Features

  • Threshold test
  • Build sequence
  • Degree unique
  • Split subclass
  • O(n+m)

More Checkers Tools

Explore all 223 other checkers tools available on Generatr

Academic Readability Graderads.txt ValidatorAI Content DetectorAlexander McQueen Serial Number CheckerAnagram CheckerAnalog Gem Tester SimulatorAnsible LinterArc-Transitive Graph CheckerAudemars Piguet Serial Number CheckerAuto Parts Compatibility CheckerBike Serial Number CheckerBlocked Checker TwitterBluesky Block CheckerBottega Veneta Serial Number CheckerBrawl Stars Mastery CheckerBulk SERP CheckerBulova Serial Number CheckerCanned Phrase & Cliche CheckerCar Stereo Compatibility CheckerCartier Love Bracelet Serial Number CheckerCartier Serial Number CheckerCeline Serial Number CheckerCetaphil Lot Number CheckerCGC Certification LookupCharacter Frequency CounterChordal Graph CheckerCircleboom Shadowban CheckerClash Royale Deck CheckerClash Royale Synergy CheckerCograph Recognition Checker
View all 223 checkers tools
Advertisement
Advertisement