32 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Indian Institute of Technology MadrasIN5 papers
- Indian Institute of Information Technology Design and Manufacturing JabalpurIN2 papers
- Institute of PhysicsPL2 papers
- National Institute of Technology RaipurIN2 papers
- Siberian Federal UniversityRU2 papers
- Banaras Hindu UniversityIN1 paper
- Birla Institute of Technology and Science, PilaniIN1 paper
- Birla Institute of Technology and Science, Pilani - Goa CampusIN1 paper
- Birla Institute of Technology, MesraIN1 paper
- Center for Advanced Systems UnderstandingDE1 paper
- Center for Astrophysics Harvard & SmithsonianUS1 paper
- Central University of JammuIN1 paper
5 papers · 1 filter
The Hamiltonian Cycle in -free Split Graphs -- A Dichotomy
P. Renjith, N. Sadagopan
In this paper, we investigate the well-studied Hamiltonian cycle problem (HCYCLE), and present an interesting dichotomy result on split graphs. T. Akiyama et al. (1980) have shown…
On strictly Chordality-k graphs
S. Dhanalakshmi, N. Sadagopan
Strictly Chordality-k graphs (SC_k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k \geq 3. Note that k = 3 and k = 4 are pre…
On 2K2-free graphs - Structural and Combinatorial View
S. Dhanalakshmi, N. Sadagopan, V. Manogna
A connected graph is 2K2-free if it does not contain a pair of independent edges as an induced subgraph. In this paper, we present the structural characterization of minimal vertex…
Some Reliability Properties of Transformed-Transformer Family of Distributions
Nil Kamal Hazra, Pradip Kundu, Asok K. Nanda
The Transformed-Transformer family of distributions are the resulting family of distributions as transformed from a random variable through another transformer random variable…
Tri-connectivity Augmentation in Trees
S. Dhanalakshmi, N. Sadagopan, D. Sunil Kumar
For a connected graph, a {\em minimum vertex separator} is a minimum set of vertices whose removal creates at least two connected components. The vertex connectivity of the graph r…