Advertisement
Graceful Labeling Checker
Edge labels = {1,2,...,m}
Loading tool...
About Graceful Labeling Checker
A graceful labeling checker testing if a tree or graph with m edges can be vertex-labeled with distinct values from {0,...,m} so that induced edge labels |f(u)−f(v)| give all values 1..m. Ringel-Kotzig conjecture: all trees are graceful. Client-side.
Graceful Labeling Checker Features
- Labeling check
- Tree focus
- Edge labels
- Path/cycle/star
- Conjecture status
More Calculators Tools
Explore all 639 other calculators tools available on Generatr
1-Sample Z-Test Calculator2-Sample Z-Test Calculator3D Surface Area CalculatorA/B Testing Significance CalculatorAbsolute Value CalculatorAbundant Number CheckerAccelerated Aging CalculatorAchromatic Number CalculatorAcyclic Chromatic Number CalculatorAdditive Persistence CalculatorAge CalculatorAging Test CalculatorAlbertson Index CalculatorAlgebraic Connectivity CalculatorAliquot Sequence CalculatorAliquot Sum CalculatorAlternating Series Test CalculatorAmicable Number FinderAnnuity CalculatorAPY CalculatorAquarium CO2 Drop CheckerArea CalculatorArea Under Curve CalculatorArithmetic Sequence CalculatorArmstrong Number CalculatorASCVD Risk CalculatorAspect Ratio CalculatorAtom Bond Connectivity CalculatorAugmented Eccentric Connectivity CalculatorAugmented Zagreb Index Calculator
View all 639 calculators toolsAdvertisement
Advertisement
Advertisement