#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2010

2016

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- HAMPIHOLI P.R, SHAILAJA S. SHIRKOL
- 2016

In this paper we generate non-isomorphic semigraphs by introducing one or two middle vertices in various classes of graphs such as a path, unicyclic graphs with adjacent pendant edges, unicyclic graphs with two nonadjacent pendant edges. Further we proceed to generate non-isomorphic bicyclic semigraphs with one common edge. We obtain the number of… (More)

- Shailaja S. Shirkol, Manjula C. Gudgeri
- 2013

In this paper we determine the number of minimum total dominating sets of paths and cycles and prove that the set of all minimum total dominating sets of a cycle forms a partially balanced incomplete block design. We also determine all cubic graphs on ten vertices in which the set of all minimum total dominating sets forms a Partially Balanced Incomplete… (More)

- Hanumappa B. Walikar, B. Devadas Acharya, Shailaja S. Shirkol
- Des. Codes Cryptography
- 2010

A (v, βo, μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V | = v and B is the set of maximum independent sets of G called blocks such that if i, j ∈ V, i = j and if i and j are not adjacent in G then there are exactlyμ blocks containing i and j . In this paper, we study (v, βo, μ)-designs over the graphs Kn × Kn, T… (More)

- ‹
- 1
- ›