S. No.
  Title  Link
 1. B.D. Acharya, Mukti Acharya and Deepa Sinha, Characterization of a signed graph whose signed line graph is S-consistent, Bulletin of The Malaysian Mathematical Sciences Society, 32(3) (2009), 335-341   [Access]
 2. B.D. Acharya, Mukti Acharya and Deepa Sinha, Cycle-Compatible Signed Line Graphs, Indian Journal of Mathematics, Allahabad Mathematical Society, 50(2)(2008), 407-414   [Access]
 3. Deepa Sinha, Ayushi Dhama and B.D.Acharya, Unitary Addition Cayley Signed Graphs, European Journal of Pure and Applied Mathematics, 6(2) (2013), 189-210.   [Access]
 4. B.D. Acharya, K.A. Germina, K.L. Princy and S.B. Rao, Graph Labelings, Embeddings and NP-Completeness theorems, Journal of Combinatorial Mathematics and Combinatorial Computation, 67(2008), 163-180.
  [Access]
 5.  Belmannu D. Acharya and K. Augustine Germina, Strongly k-Indexable Unicyclic Graphs, Graph Theory Notes of NewYork, LV(2008), pp 45-49.   [Access]
 6.  B.D. Acharya, K.A. Germina, K.L. Princy and S.B. Rao, Embeddings and NP- Completeness theorems for set-graceful. Topologically set-graceful and set- sequential graphs, Discrete Mathematical Sciences and Cryptography, 12(4) (2009), pp481-487.   [Access]
 7.  B. D Acharya, Germina K. A, Kumar Ahbishek, S. B. Rao and Thomas Zaslavsky, Point and Arc reaching sets of vertices in a digraph, Indian Journal of Mathematics,Vol.51(2009), pp 597-609.   [Access]
 8.  B. D. Acharya and Germina K. A, Unigeodesic Graphs and Related Recent Notions, International Journal of Algorithms, Computing and Mathematics, Vol 3, No1. 2010, pp 89-92.   [Access]
 9.  B. D. Acharya and Germina K. A., Vertex Graceful graphs, Discrete Mathematical Sciences and Cryptography , Vol 13 (2010) No.4., pp 453-463.   [Access]
 10. Germina K. A and Shahul Hameed, Three Matrices associated with Signed Graphs and their Energies , Applies Mathematical Sciences, Vol.4 (2010) No. 70, 3355- B.D. Acharya, K.A. Germina and Viji Paul, Linear hypergraph set-indexers of a graph, International Mathematical Forum, 5(68)(2010), 3359-3370.   [Access]
 11. B.D. Acharya, K.A. Germina and Viji Paul, Linear hypergraph set-indexers of a graph, International Mathematical Forum, 5(68)(2010), 3359-3370.   [Access]
 12. B. D. Acharya, K. A Germina and Jisha Elizabath Joy, Topogenic Graphs, Advanced Studies in Contemporary Mathematics, 21 (2011), No.2., pp 139-159.   [Access]
 13. B.D. Acharya, Germina K.A. and Jisha Elizabath Joy, Set-valuations of a digraph, Global Journal of Pure and Applied Mathematics, Vol. 7, number 3(2011), pp. 237-243.   [Access]
 14. B.D. Acharya, Kumar Abhishek and K.A. Germina, Hypergraphs of Minimal Arc Bases in a Digraph, JCISS, To appear   [Access]
 15. B D Acharya, K A Germina, Kumar Abhishek and P J Slater, Some new results on set-graceful and set-sequential graphs, JCISS, To appear   [Access]
 17. B.D. Acharya, K.A. Germina, K.L. Princy and S.B. Rao, Topologically set-graceful graphs, Journal of Combinatorial Information System Sciences, To appear   [Access]
 18. B.D. Acharya, K. A. Germina and Beena Koshy, A creative survey on complementary distance pattern uniform sets of vertices in a graph, Journal of Combinatorial Information System Sciences, To appear.   [Access]
 19. B. D Acharya, Germina K. A, Rency Kurian, Viji Paul and Thomas Zaslavsky, Interference in Graphs, Journal of Combinatorics, Information and System. To appear.   [Access]
 20.  B.D. Acharya, Representing hypergraphs by families of sets with given properties, Indian J. Math.. 51(Pramila Srivastava Memorial Volume)(3)(2009), 523-536.   [Access]
 21.  B.D. Acharya, Germina K.A., Kumar Abhishek, S.B. Rao and T. Zaslavsky, Point- and arc-reaching sets of vertices in a digraph, Indian J. Math., 51(Pramila Srivastava Memorial Volume)(3)(2009), 597-609.   [Access]
 22.  B.D. Acharya, Role of cognitive balance in some notions of graph labelings: Inuence of Frank Harary, Frietz Heider, Gustav Kirchhoff and Leonhard Euler, Bulletin of Allahabad Mathematical Society, 24(Pramila Srivastava Memorial Volume)(Part 2)(2009), 391-427.   [Access]
 23.   B.D. Acharya, Characterization of Eulerian set-sequential graphs, Bull. Calcutta Math. Soc., (To appear)   [Access]
 24.  B.D. Acharya, Signed intersection graphs, J. Discrete Math. Sci. & Cryptography, (To appear)   [Access]
 25.  B.D. Acharya and K.A. Germina, Vertex-graceful graphs, J. Discrete Math. Sci. & Cryptography, Vol 13 (2010), No. 5, pp. 453-463   [Access]
 26. B.D. Acharya, K.A. Germina, K.L. Princy and S.B. Rao, Graph labellings, embedding and NP-completeness theorems, Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC), 67(2008), 163-180.   [Access]
 27.  B.D. Acharya, K.A. Germina, K.L. Princy and S.B. Rao, Graph labellings, embedding and NP-completeness theorems, Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC), 67(2008), 163-180.   [Access]
 28.   B.D. Acharya and Germina K.A., Strongly k-indexable unicyclic graphs, Graph Theory Notes of New York,  LV (Fall 2008),   [Access]
 29.  H.S. Ramane, D.S. Revankar, I.Gutman, S.B. Rao, B.D. Acharya, H.B. Walikar, Estimating the distance energy of graphs, Graph Theory Notes of New York, 55 (2008), 27 - 32.   [Access]
 30.  Role of Cogniyive Balance in Some Notions of Graph Labelings: Influence of Frank Harary,Frietz Heider,Gustav Kirchhoff and Leeonhard Euler',B.D.Acharya,Vol. 24, part 2,2009,391-413   [Access]
 31.  H.B. Walikar, B.D. Acharya and Shailaja Shirkol, Partially Balanced incomplete block designs of maximum independent sets of certain regular graphs, Codes and Cryptography, (To appear.)   [Access]
 32.   T. Singh, S.B. Rao, B.D. Acharya and M. Acharya, Hypergraceful complete graphs,  Australasian J. Combinatorics, To appear.   [Access]
 33.  B.D. Acharya and K.A. Germina, Maximal strongly indexable outerplanar graphs, Ars Combinatoria (To appear)   [Access]
 34.  Connected Graphs Switching Equivalent To Their Iterated Line Graphs, B.Devadas Acharya, Discrete Mathematics 41 (1982) 115-122   [Access]
 35.  Locally Semi-consecutive edge labelings of graphs,B.D.ACHARYA AND S.M.HEGDE*,Nat.Acad.Sci.Letters,Vol.24,No.5 to 12,2001   [Access]
 36. A note on dominatimg functions of a graph, BELMANNU DEVADAS ACHARYA, Nat.Acad.Sci.Letters,Vol.24,No.5 to 12,2001   [Access]
 37. Construction of Certain Infinite Families of Graceful Graphs from a Given Graceful Graphs,B.D.Acharya,Def Sci J,Vol 32, No3, July 1982, pp2231-236   [Access]
 38.  On D-sequential graphs,B.Devadas Acharya,Jour. Math. Phy. Sci. Vol. 17, No.1, 1983.   [Access]


Welcome to My Library

Sign In | Sign Up
(You will need a GMail ID to sign up)
Ċ
vol10no4-8.pdf
(1307k)
The Scientific Indian,
Jul 1, 2015, 3:28 AM
v.1