A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS

A note on arbitrarily vertex decomposable graphs

A graph (G) of order (n) is said to be arbitrarily vertex decomposable if for each sequence ((n_{1},ldots,n_k)) of positive integers such that (n_{1}+ldots+n_{k}=n) there exists a partition ((V_{1},ldots,V_{k})) of the vertex set of (G) such Sideboard that for each (i in {1,ldots,k}), (V_{i}) induces a connected subgraph of (G) on (n_i) vertices.In

read more


A critical review on metal-organic frameworks (MOFs) based nanomaterials for biomedical applications: Designing, recent trends, challenges, and prospects

Nanomaterials (NMs) have garnered significant attention in recent decades due to their versatile applications in a wide range of fields.Thanks to their tiny size, enhanced surface modifications, impressive volume-to-surface area ratio, magnetic properties, and customized optical dispersion.NMs experienced an incredible upsurge in biomedical applica

read more