Hayk Grigoryan

  • Citations Per Year
Learn More
The broadcast time of a graph G, denoted b(G), is the minimum time necessary to complete the broadcasting in G, i.e. from one of vertices send a message to all other vertices. The Knödel graph W∆,n is a regular graph of even order and degree ∆ where 2 ≤ ∆ ≤ blog2 nc. The broadcast time of the Knödel graph is known only for W∆,2∆ and for W∆−1,2∆−1 . In this(More)
The broadcast time of a graph G, denoted 6(G), is the minimum time necessary to complete the broadcasting in G, i.e. from one of vertices send a message to all other vertices. The Kno&#x0308;del graph W<sub>&#x0394;, n</sub> is a regular graph of an even order n and degree &#x0394; where 2 &#x2264; &#x0394; &#x2264; &#x230A;log<sub>2</sub> n&#x230B;. The(More)
  • 1