#### Filter Results:

#### Publication Year

2004

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].

Recently, the authors have established a large class of modular relations involving the Rogers-Ramanujan type functions J(q) and K(q) of order ten. In this paper, we establish further modular relations connecting these two functions with Rogers-Ramanujan functions, Göllnitz-Gordon functions and cubic functions, which are analogues to the Ramanujan's forty… (More)

Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al. [1] have introduced the concept of color energy of a graph E c (G) and computed the color energy of few families of graphs with χ(G) colors. In this paper we derive explicit formulas for the color… (More)

Recommended by Teodor Bulboac˘ a We give new proof of a four-variable reciprocity theorem using Heine's transformation, Watson's transformation, and Ramanujan's 1 ψ 1-summation formula. We also obtain a generalization of Jacobi's triple product identity.

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bounds given by Beineke and Hegde [3] and Adiga, Ramaswamy and Somashekara [2], for n ≥ 28.

- ‹
- 1
- ›