#### 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

#### Publication Venue

#### 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)

- 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

In this paper, the concept of minimum hub distance energy EHd(G) of a connected graph G is introduced and minimum hub distance energies of some standard graphs and a number of wellknown families of graphs are computed. Upper and lower bounds for EHd(G) are also established.

- Siddani Bhaskara Rao
- Discrete Mathematics
- 1979

- 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 K p , p ≥ 6, is graceful, and we also give a characterization of graceful signed graphs on K p , p ≤ 5. This implies that there is no subset A of cardi-nality p ≥ 6 from the set {0, 1 2 p 2 , such that each element of the set {1, 2,. .. , n} occurs exactly twice and each element of the… (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.

- ‹
- 1
- ›