Digital Repository

Browsing by Issue Date

Browsing by Issue Date

Sort by: Order: Results:

  • The Connected Domination Number of Grids 
    SRINIVASAN, ADARSH; Narayanaswamy, N. S. (Springer Nature, 2021-01)
    Closed form expressions for the domination number of an n×m grid have attracted significant attention, and an exact expression has been obtained in 2011 [7]. In this paper, we present our results on obtaining new lower ...
  • Colonial and Modern Architecture in India 
    SOHONI, PUSHKAR (Oxford University Press, 2021-01)
  • Prediction, Predictability, and Multi-Decadal Variability of the South Asian Monsoon 
    Goswami, B. N.; MANI, NEENA JOSEPH (World Scientific Publishing, 2021-01)
    Advances made in seasonal prediction and predictability of the south Asian monsoon (SAM) over the past decade is briefly reviewed. To achieve potential skill of prediction of SAM rainfall, a major targeted effort to improve ...
  • Parameterized Complexity of Locally Minimal Defensive Alliances 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    A defensive alliance in a graph G=(V,E) is a set of vertices S satisfying the condition that every vertex v∈S has at least as many neighbours (including itself) in S as it has in V∖S . We consider the notion of local ...
  • Parameterized Complexity of Defensive and Offensive Alliances in Graphs 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    In this paper we study the problem of finding small defensive and offensive alliances in a simple graph. Given a graph G=(V,E) and a subset S⊆V(G) , we denote by dS(v) the degree of a vertex v∈V in G[S], the subgraph of G ...
  • The Balanced Satisfactory Partition Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    The Satisfactory Partition problem asks whether it is possible to partition the vertex set of a given undirected graph into two parts such that each vertex has at least as many neighbours in its own part as in the other ...

Search Repository


Advanced Search

Browse

My Account