Sandhya Anilkumar tapadia

@vupune.ac.in

Assistant Professor in the Department of Engineering Sciences, Faculty of Science & Technology
Vishwakarma University

Sandhya Anilkumar tapadia


                           Download Compact PDF  
https://researchid.co/tapadiasandhya

EDUCATION

Ph. D. in Mathematics

RESEARCH, TEACHING, or OTHER INTERESTS

Discrete Mathematics and Combinatorics, Applied Mathematics
4

Scopus Publications

Scopus Publications

  • Graph theoretic properties of good sets in hypercube
    S. A. Tapadia, N. V. Shinde, B. N. Waphare
    International Journal of Computer Mathematics Computer Systems Theory, 2024
    A good set on k vertices is a vertex induced subgraph of the hypercube Qn that has the maximum number of edges. In this paper we discuss graph theoretic properties of good sets including connectivity, vertex decomposition, domination and identifying path covers of good sets.
  • Order Structure of Good Sets in Hypercube
    N. V. Shinde, , S. A. Tapadia, B. N. Waphare, , and
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2023
    A good set on k vertices is a vertex induced subgraph of the hypercube Qn that has the maximum number of edges. The long-lasting problem of characterizing graphs that are cover graphs of lattices is NP-complete. This paper constructs and studies lattice theoretic properties of a class of lattices whose cover graphs are isomorphic to good sets.
  • Cycle decompositions of the cartesian product of cycles
    Australasian Journal of Combinatorics, 2019
  • The line completion number of hypercubes
    S.A. Tapadia, B.N. Waphare
    Akce International Journal of Graphs and Combinatorics, 2019
    In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also defined the line completion number of graph G to be the minimum index for which is complete. They found the line completion number for certain classes of graphs. In this paper, we find the line completion number of hypercube for every .