#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1979

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Harishchandra S. Ramane, Hanumappa B. Walikar, +4 authors Ivan Gutman
- Appl. Math. Lett.
- 2005

- Siddani Bhaskara Rao
- J. Comb. Theory, Ser. B
- 1979

- K. P. Chithra, K. A. Germina, +4 authors U. S. R. Murty
- 2015

Let N0 denote the set of all non-negative integers and X be any subset of X. Also denote the power set of X by P(X). An integer additive set-labeling (IASL) of a graph G is an injective function f : V (G) ! P(X) such that the induced function f+ : E(G) ! P(X) is defined by f+(uv) = f(u) + f(v), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL f is… (More)

- Siddani Bhaskara Rao
- Discrete Mathematics
- 1979

- E. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum
- Electronic Notes in Discrete Mathematics
- 2003

- Veena Mathad, Sultan Senan Mahde, +17 authors H. B. Walikar
- 2015

1. C. Adiga, A. Bayad, I. Gutman, S. A. Srinivas, The minimum covering energy of a graph, Kragujevac Journal of Science, 34(2012), 39-56. 2. R. B. Bapat, Graphs and Matrices, Hindustan Book Agency, 2011. 3. R. B. Bapat, S. Pati, Energy of a graph is never an odd integer, Bulletin of Kerala Mathematics Association, 1(2011), 129-132. 4. J. Bermond, J. Bond,… (More)

- EQUIENERGETIC GRAPHS, Harishchandra S. Ramane, +5 authors Ivan Gutman
- 2003

The energy of a graph is the sum of the absolute values of its eigenvalues. Two graphs are said to be equienergetic if their energies are equal. We show how infinitely many pairs of equienergetic graphs can be constructed, such that these graphs are connected, possess equal number of vertices, equal number of edges, and are not cospectral.

- Siddani Bhaskara Rao, B. Devadas Acharya, Tarkeshwar Singh, Mukti Acharya
- Australasian J. Combinatorics
- 2010

In this paper we prove that no signed graph on the complete graph Kp, p ≥ 6, is graceful, and we also give a characterization of graceful signed graphs on Kp, p ≤ 5. This implies that there is no subset A of cardinality p ≥ 6 from the set {0, 1, . . . , (p 2 ) − n}, n ≤ 1 2 ( p 2 ) , such that each element of the set {1, 2, . . . , n} occurs exactly twice… (More)

- ‹
- 1
- ›