I. Sahul Hamid

14 papers Journal 14

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Edge-criticality in trees upon outer connected independence. Discret. Math. Algorithms Appl. M. Fatima Mary, I. Sahul Hamid
2025	J	`jnl`	Equitable path decomposition of graphs. Discret. Math. Algorithms Appl. I. Sahul Hamid, H. Shanmuga Priya, S. Saravanakumar
2024	J	`jnl`	Majority double Roman domination in graphs. Discret. Math. Algorithms Appl. S. Anandha Prabhavathy, I. Sahul Hamid
2023	J	`jnl`	Some results on majority bad number. Discret. Math. Algorithms Appl. I. Sahul Hamid, S. Anandha Prabhavathy
2019	J	`jnl`	Open packing bondage number of a graph. Discret. Math. Algorithms Appl. S. Saravanakumar, A. Anitha, I. Sahul Hamid
2017	J	`jnl`	Criticality of outer - connected independence upon edge removal. Electron. Notes Discret. Math. I. Sahul Hamid, M. Fatima Mary
2016	J	`jnl`	Changing and unchanging Open Packing: Edge removal. Discret. Math. Algorithms Appl. I. Sahul Hamid, S. Saravanakumar
2016	J	`jnl`	Majority reinforcement number. Discret. Math. Algorithms Appl. I. Sahul Hamid, S. Anandha Prabhavathy
2015	J	`jnl`	Outer-connected independence in graphs. Discret. Math. Algorithms Appl. I. Sahul Hamid, R. Gnanaprakasam, M. Fatima Mary
2015	J	`jnl`	Vertex criticality with respect to isolate domination. Discret. Math. Algorithms Appl. I. Sahul Hamid, S. Balamurugan
2014	J	`jnl`	Global dominating sets in minimum coloring. Discret. Math. Algorithms Appl. I. Sahul Hamid, M. Rajeswari
2013	J	`jnl`	Further Results on induced graphoidal Decomposition. Discret. Math. Algorithms Appl. I. Sahul Hamid, Mayamma Joseph
2011	J	`jnl`	On the Label graphoidal Covering Number-II. Discret. Math. Algorithms Appl. I. Sahul Hamid, A. Anitha
2007	J	`jnl`	Simple acyclic graphoidal covers in a graph. Australas. J Comb. S. Arumugam, I. Sahul Hamid

Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda

Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski