S. Monikandan

From MaRDI portal
Person:396676

Available identifiers

zbMath Open monikandan.sMaRDI QIDQ396676

List of research outcomes





PublicationDate of PublicationType
Nonsplit Graphs with Split Maximal Induced Subgraphs2024-02-14Paper
https://portal.mardi4nfdi.de/entity/Q60418832023-05-15Paper
https://portal.mardi4nfdi.de/entity/Q58766762023-02-01Paper
https://portal.mardi4nfdi.de/entity/Q58715782023-01-23Paper
https://portal.mardi4nfdi.de/entity/Q50256912022-02-02Paper
Reconstruction number of graphs with unique pendant vertex2021-10-21Paper
https://portal.mardi4nfdi.de/entity/Q33822252021-09-20Paper
Graphs with arbitrarily large adversary degree associated reconstruction number2021-09-01Paper
Degree associated edge reconstruction number of split graphs with biregular independent set is one2021-09-01Paper
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph2021-08-16Paper
https://portal.mardi4nfdi.de/entity/Q50002972021-07-12Paper
https://portal.mardi4nfdi.de/entity/Q58588692021-04-14Paper
Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible2019-12-30Paper
https://portal.mardi4nfdi.de/entity/Q52325942019-09-12Paper
Reconstruction of distance hereditary 2-connected graphs2018-06-07Paper
Degree Associated Edge Reconstruction Parameters of Strong Double Brooms2018-03-05Paper
https://portal.mardi4nfdi.de/entity/Q31343402018-02-09Paper
https://portal.mardi4nfdi.de/entity/Q45983692017-12-20Paper
Degree associated reconstruction number of biregular bipartite graphs whose degrees differ by at least two2017-12-01Paper
Degree associated reconstruction number of split graphs with regular independent set2017-12-01Paper
https://portal.mardi4nfdi.de/entity/Q45942072017-11-17Paper
https://portal.mardi4nfdi.de/entity/Q29593442017-02-09Paper
Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n−22016-12-14Paper
On pairs of graphs having \(n-2\) cards in common.2016-10-26Paper
Adversary degree associated reconstruction number of graphs2015-04-15Paper
Degree Associated Edge Reconstruction Number2014-08-19Paper
Degree associated edge reconstruction number of graphs2014-08-13Paper
A reduction of the graph reconstruction conjecture2014-07-28Paper
https://portal.mardi4nfdi.de/entity/Q53974832014-02-21Paper
Reconstruction of bipartite graphs and triangle-free graphs with connectivity two2012-09-05Paper

Research outcomes over time

This page was built for person: S. Monikandan