Topic
Gray graph
About: Gray graph is a research topic. Over the lifetime, 187 publications have been published within this topic receiving 2750 citations.
Papers published on a yearly basis
Papers
TL;DR: A graph of n vertices, having chromatic number r which contains no complete graph of r Vertices, contains a vertex of degree not exceeding n(3r-7)/(3 r-4).
249 citations
TL;DR: If the edges of a finite complete graph K are colored with r colors then the vertex set of K can be covered by at most cr 2 log r vertex disjoint monochromatic cycles.
168 citations
TL;DR: In this paper, it was shown that for every k there is a constant c k such that if n > ck then there exists a Hamiltonian cycle with adjacent edges having different colours.
Abstract: Coloar the edges of a complete graph with n vertices in such a way that no vertex is on more than k edges of the same colour . We prove that for every k there is a constant c ksuch that if n > ck then there is a Hamiltonian cycle with adjacent edges having different colours . We prove a number of other results in the same vein and mention some unsolved problems .
99 citations
TL;DR: A graph having 27 vertices is described, whose automorphism group is transitive on vertices and undirected edges, but not on directed edges.
Abstract: A graph having 27 vertices is described, whose automorphism group is transitive on vertices and undirected edges, but not on directed edges.
97 citations
TL;DR: A graph G of diameter 2 is minimal if the deletion of any edge increases its diameter if and when G has n vertices then it has at most [n 2 /4] edges.
Abstract: A graph G of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for n>n 0 . If G has n vertices then it has at most [n 2 /4] edges. The only extremum is the complete bipartite graph
76 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 2 |
| 2020 | 1 |
| 2018 | 6 |
| 2017 | 6 |
| 2016 | 6 |
| 2015 | 4 |