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
4 papers · 1 filter
Star Colouring of Bounded Degree Graphs and Regular Graphs
Shalu M. A., Cyriac Antony
A -star colouring of a graph is a function such that for every edge of , and every bicoloured connected subgraph of …
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…
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…
A Dirac-type Characterization of k-chordal Graphs
R. Krithika, Rogers Mathew, N. S. Narayanaswamy +1
Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{á}tal et al. Note: Dirac-type characterizations of graphs without long chordles…