Digital Repository

Browsing by Issue Date

Browsing by Issue Date

Sort by: Order: Results:

  • GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2020-12)
    The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in ...
  • MAITY, SOUMEN (Springer Nature, 2020-12)
    Given a graph G=(V,E) , the vertex expansion of a set S⊂V is defined as ΦV(S)=|N(S)

Search Repository


Advanced Search

Browse

My Account