Vizing's Weaker Conjecture $(\delta,\Delta) = (7,15)$
![](https://ojsdergi.com/ojsicons/gor.png)
![](https://ojsdergi.com/ojsicons/pdf.png)
Keywords:
Critical graphs, degree sequenceAbstract
Vizing conjectured that $G$ is a simple and $\Delta$-critical graph with $m$ edges then $2m \geq \Delta^2$. In this paper, we prove, the conjecture for graphs with $\delta = 7$ and $\Delta = 15$.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Mathematics And its Applications
![Creative Commons License](http://i.creativecommons.org/l/by-nc/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.