Graphs with restricted valency and matching number

Niranjan Balachandran; Niraj Khare

Graphs with restricted valency and matching number

组合数学 2007-05-23 v1

作者: Niranjan Balachandran , Niraj Khare

摘要

Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$ . In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all the cases when the maximal graph is unique. We also provide a new proof of Gallai's lemma concerning factor critical graphs.

关键词

graph pebbling graph theory graph coloring

引用

@article{arxiv.math/0611842,
  title  = {Graphs with restricted valency and matching number},
  author = {Niranjan Balachandran and Niraj Khare},
  journal= {arXiv preprint arXiv:math/0611842},
  year   = {2007}
}

备注

13 pages

相关论文

查看更多相关论文 →