Name
Abstract | ||
|---|---|---|
Suppose that n ⩾ 2 t + 2 ( t ⩾ 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v , there are at least t common neighbours. Then we prove that |E(G)|≥⌈ (2t+1)n−2t 2 -3) 2 (n≤3t−1) and |E(G)z.sfnc;≥(t+1)n−t 2 −t−3 (n≥3t). Furthermore, the results are sharp. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0012-365X(97)00078-2 | Discrete Mathematics |
Keywords | Field | DocType |
maximum number,fixed edge-degree | Graph,Discrete mathematics,Combinatorics,Bound graph,Vertex (geometry),Mathematics,Path graph | Journal |
Volume | Issue | ISSN |
183 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| J. Sheehan | 2 | 0 | 0.34 |