The study of C4 saturated graph
碩士 === 淡江大學 === 中等學校教師在職進修數學教學碩士學位班 === 101 === Let G be a graph. If there is no 4-cycle contained in G and connecting any non adjacent vertices of G will obtain a 4-cycle, then we call G is a C4 saturated graph. Let sat(n, C4) and ex(n, C4) be the minimum and maximum number of edges of all C4 satur...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02382437665055322192 |