On alpha-critical graphs and their construction
<p> A graph <i>G</i> is α-critical (or removal-critical) if α(<i>G–e</i>) = α(<i>G</i>)+1 for all edges ∈ 2 <i>E</i>(<i>G</i>), where α(<i> G</i>) is the vertex in...
| Main Author: | |
|---|---|
| Language: | EN |
| Published: |
Washington State University
2015
|
| Subjects: | |
| Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=3717480 |