ADMA International Conference on Discrete Mathematics

Program and Conference Schedule

Venue: Main talks CS 15. Parallel sessions A, B, C, D, E in rooms KCB 504, 505, 506, 519, and 522 resp.

Time Session Speaker Title of Talk
Day 1: 7 June 2026
9:00–10:00Inauguration & Technical SessionA Vijayakumar The Shrikhande Graph
10:00–11:00Invited TalkSuresh Govindarajan Aspects of higher dimensional partitions
β€” Coffee Break β€”
11:30–12:30SS Srikhande Memorial Endowment LectureNishad Kothari Investigating snarks thru the lens of matching covered graphs
β€” Lunch Break β€”
14:00–15:00Invited TalkYasmeen Akthar A Hypergraph Model for Combinatorial Testing: The Qualitative Independence (QI) Framework
15:00–16:00Prof. R. Balakrishnan Endowment LectureR Venkatesh How to obtain the Tutte polynomials of graphs from representation-theoretic methods?
β€” Coffee Break β€”
Best Paper Presentations (16:30–; 15+5 min each · Venue: NAC 522)
16:30–16:50Best PaperNeha GoregaokarThe geometry of a counting formula for deformations of the braid arrangement
16:50–17:10Best PaperSanthosh RaghulΞΈ-free graphs: characterization and consequences
17:10–17:30Best PaperYash ChawdaOn the Majority Game Chromatic Number of Trees
17:30–17:50Best PaperVishnu KumarTight Bounds on the Caratheodory and Exchange Numbers
17:50–18:10Best PaperBikramjit RoyTropical Nets and Their Role in Kleene Stars of Tropical Matrices
18:10–18:30Best PaperBiswajit DasOn Patterns and Languages in 1-11-Representations of Graphs
18:30–18:50Best PaperAbhishek Girish AherRamsey Sequences with Bounded Clique Number
18:50–19:10Best PaperMidhuna V. AjithOn the Structure and Invariants of Endomorphism Graphs of Finite Groups
Day 2: 8 June 2026
9:00–10:00Invited TalkGyula Katona ErdΕ‘s-Ko-Rado theorem, ErdΕ‘s Matching Conjecture, between and around
10:00–11:00Prof. Paulraja Endowment LectureV Arvind Aspects of the Weisfeiler-Leman Procedure
β€” Coffee Break β€”
11:30–12:30Invited TalkCarol Zamfirescu Recent results on Hamiltonian cycle enumeration
β€” Group Photo Session β€”
β€” Lunch Break β€”
14:00–15:00Invited TalkRajat Kanti Nath Commuting graphs of rings
15:00–16:00Dr. B. D. Acharya Memorial Endowment LectureEckhard Steffen Perfect matchings in r-graphs
β€” Coffee Break β€”
Parallel Sessions (16:30–18:30; 15+5 min each × 5 tracks · Venues KCB: A:522; B:519; C:504; D:505; E:506)
TimeTrackSpeakerTitle
16:30–16:50 Track A Kripa Shaji Steiner Strong Sum Distance in Fuzzy Graphs
Track B Praveen Mathil On Connectivity of Clean Graphs of Commutative Rings
Track C Arshiya Farhath Well-Covered Circulant Graphs
Track D Esha Nair M On Cohn-Macaulay and Gorenstein Properties of Jacobson Graph of Commutative Rings
Track E Nagaraja P Sharp Bounds on the Augmented Sombor Index and Related Inequalities
16:50–17:10 Track A Eshwar Srinivasan Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
Track B Jyothrmoy Jana Some results on the generalized comaximal graph of a near-ring
Track C Sahana S R On the Path Energy of Graphs: Inequalities and Computations
Track D Jane Shonon Cutinha Designing a Public-Key Cryptosystem Using Graph Partitioning into Perfect Matching
Track E Md Sohail Simplicial Vertices of Superpower Graph of An, D2n and EPPO Group
17:10–17:30 Track A Sauvik Poddar Cayley colour integral groups
Track B Labani Sarkar Difference Subgroup Graph
Track C Suchanda Roy Characterization of Word-Representable Near-Triangulations
Track D Rushikesh Barabde Hamiltonian Decomposition of Augmented Cubes
Track E Shivaragavi Rajendran Generalized Edge Metric Codes for Molecular Graphs of Fungal Treatment Drugs
17:30–17:50 Track A Raina Mary Thomas Covering Arrays on Direct Product Graphs
Track B Yashaswini L On the Spectral Radius of Atom-Bond Maximum Degree-Based Sum-Connectivity Matrix
Track C Balkishbanu Khaji Eccentric Sombor Index of Graphs and Its Role in the Structure-Property Relationship Analysis of Polycyclic Aromatic Compounds
Track D Anjitha Ashokan Eccentricity energy change of coalescence of graphs due to edge deletion
Track E Surendrakumari J Reduced Reverse Degree-Based Topological Indices and QSPR Analysis of Drugs Used for Breast Cancer Treatment
17:50–18:10 Track A Pradeepa P Weak Edge-to-Vertex Detour Parameters and their Application to Chronic Pain Networks Modelling
Track B Subrahmanya Shenoy Simple intersection graph of a finite lattice
Track C Debolina Ghosh A classification of semi-equivelar gems on the double torus
Track D Biplab Basak A characterization of normal 3-pseudomanifolds with gβ‚‚ ≀ 4
Track E Benjamin John Edge Moment of a Graph: Structural Descriptors, Polynomial Representations, and Correlation with Octane Properties
18:10–18:30 Track A Debyani Manna Some Results on Extended Inverse Problem of A+2Β·A
Track B Ardra A N On Intersection Hypergraph of β„€n
Track C Joyentanuj Das A q-analogue of distance matrix of bi-block graphs
Track D Sowmya Prabha B.C Energy of Graphs with Multiple Self-Loops
Track E Yash Patel On the Sombor Index and Its Variants in Powers of Cycle Graphs
🍽️ Conference Banquet  (19:00–21:00 · Venue: Terrace Hall)
Day 3: 9 June 2026
9:00–10:00Invited TalkMargaret Bayer Simplicial Complexes from Graphs
10:00–11:00Dr. V. Swaminathan Endowment LectureS Viswanath Littlewood-Richardson coefficients: an overview
β€” Coffee Break β€”
11:30–12:30Prof. Frank Harary Memorial Endowment LectureHiranya Kishore Dey Subgroup counts and structure of finite groups.
β€” Lunch Break β€”
14:00–15:00Invited LecturePriyavrat Deshpande One Notion, Many Generalizations: The Story of Chordality in Higher Dimensions
β€” Coffee Break β€”
Parallel Sessions (15:30–18:30; 15+5 min each × 5 tracks · Venues KCB: A:522; B:519; C:504; D:505; E:506)
TimeTrackSpeakerTitle
15:30–15:50 Track A Dipnit Biswas Polytope–Tableau Correspondences for Type A KR Crystals
Track B Aloysius Godinho On Group Distance Magic Labeling of Circulant Graphs and Graph Products
Track C Sini P The Aharoni-Korman Conjecture for Partially Semi-well Ordered Sets
Track D Swathi D Secure Domination in Bisplit Graphs - An Algorithmic Study
Track E Soumyashree Rana On the Complexity of Co-secure Dominating Set Problem
15:50–16:10 Track A Iswar Mahato Eigenvalue multiplicity and energy of distance and Seidel matrices of cographs
Track B Vysakh C Eccentric Connectivity Index of Strongly Connected Digraphs
Track C Nithya Muraleedharan Degree Restricted Domination in Complement Graphs
Track D Anuvinda J Generalized Binomial Edge Ideals of Whisker Graphs via an Extension of Generalized Corona Products
Track E Prashant Pandurang Waghmare Cohen-Macauleyness of the Zero-divisor Graph of a Boolean Poset
16:10–16:30 Track A Balaji Rohidas Kadam More Results on Modular Nim Game
Track B Peer Abdul Manan Bounds for the trace norm of AΞ± matrix of digraphs
Track C Carunya R Bounds on Burning Number for Butterfly-Type Networks
Track D Prof. Madhavi Levaku Idempotent Cayley Graph and its Basic Properties
Track E Shrinivas Neeralakeri Sharp Bounds for the Elliptic Sombor Index of Four New Graph Operations
16:30–16:50 Track A John J Chavara Step systems of Ptolemaic graphs and Some of its subclasses
Track B Amitayu Banerjee Automorphism groups and Distinguishing Colorings of Central and Middle Graphs
Track C Akankshya Sahu Gallai's Path Decomposition of Cayley Graph of Finite Abelian Group
Track D Nalliah M Further results on Local Inclusive Distance Antimagic Chromatic number for some families of Graphs
Track E Priyanka Vishwakarma Exploring Symmetry-Breaking Parameters in Selected graph families
16:50–17:10 Track A Aswathi H On the Dynamic Colouring of Generalised Mycielskian of Some Graph Classes
Track B Akhila M S An Application to Zero-divisor Graphs in Quantum Mechanics
Track C Krishnadas K Studies on various notions of ip-convexity on directed acyclic graphs and its relationship with directed graphs
Track D Meenalochani S Hardness Results for Vertex-Edge Roman Domination in Graphs
Track E Ann Mary George A Symmetric Double Encryption Cryptography Algorithm using Complete Bipartite graphs
17:10–17:30 Track A Dr Priyanka Singh Sombor Index and Its Variations for different Powers of Path Graphs
Track B Umang Jethva Domination Number of the Commuting Graph and the Number of Centralizers of a Finite Group
Track C Vijayraj S. Kamble Edge Degree Zagreb Indices Of Graph Transformations And Its Applications
Track D Alaka Mohan On the Neighbourhood Matrices of Circulant Graphs
Track E Thara RJ The Influence of Girth and Degeneracy on Semitotal Dominating Set
17:30–17:50 Track A Sanu C Degree-Constrained Spanning and Steiner Trees on Structured Graph Classes
Track B Jyothish S Terminal Steiner tree problem: Complexity and Algorithms
Track C Chaadhanaa A Multi-Decomposition of Complete Tripartite Graphs Into Trees of Order Five
Track D Karishma B Bridging Uncertainty and Connectivity: IFSH Tree Models for Dynamic Fiber Cable Networks
Track E Dhanya Roy The vertex visibility number of graphs
17:50–18:10 Track A Alin Sheba Mathew Italian Domination in Splitting Graph of a Graph
Track B Rumki Ghosh Injective Coloring of Interval graphs
Track C Maurice Local Distance Antimagic Labeling of Neighborhood Balanced Colored Graphs-2
Track D Aishwarya Nayak On the structure of graphs with respect to standard elements
β€” ADMA GBM β€”
Day 4: 10 June 2026
Chair:R Balaji
9:00–10:00Invited LectureManoj Changat Smooth Graphs
10:00–11:00Invited LectureRogers Mathew Towards a Conjecture on Long Induced Rainbow Paths in Triangle-Free Graphs
β€” Coffee Break β€”
11:30–12:30Prof. E. Sampathkumar Memorial Endowment LectureBrahadeesh Sankaranarayanan Intersection Graphs and Path Representations
Graph Theory Day Celebration and Valedictory Ceremony
β€” Vote of Thanks β€”