Výsledky vyhledávání - "A. Anto Kinsley"

Computation of Odd Geo-Domination Number of a Graph

A geodominating set S ⊆ V of a graph G is said to be an odd geo-dominating set if for every vertex , , and The minimum cardinality of the odd geo-dominating set is called odd geo-domination number denoted by . The odd geo-dominating set with cardin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bad0e3522a88ceefd9e4087785c707ba
https://zenodo.org/record/5525596

Zobrazit plný text záznamu

Bounds on the Connected Domination in Graphs

Autor: Athisayanathan S, Vinolin J, Ramesh Dst, Anto Kinsley A

Publikováno v: Journal of Computational Mathematica. :1-13

A set S ⊆ V of a connected graph G is a hop dominating set of G if for every vertex v ∈ V S there exists a vertex u ∈ S such that d (u, v) = 2. The cardinality of a minimum hop dominating set of G is called the hop domination number and is deno

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4e872ff36881257aca310b059f28943e
https://doi.org/10.26524/cm22

Zobrazit plný text záznamu

An edge rm- distance monophonic number of a graph

Autor: M. Shanthi, A. Anto Kinsley

Publikováno v: PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019).

Let G be a connected graph of order at least two. We study about monophonic radius- distance monophonic set and define a set for an edge called edge rm-distance monophonic set of G. An edge rm-distance monophonic set of different kinds of graphs are

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b2edcee13927908264409fa2c53640a4
https://doi.org/10.1063/5.0017035

Zobrazit plný text záznamu

Exact R-complete domination in graphs

Autor: A. Anto Kinsley, V. Annie Vetha Joeshi

Publikováno v: PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS RESEARCH (ICAMR - 2019).

Let G = (V, E) be a nontrivial connected graph. A set S ⊂ V is said to be an Exact r-complete dominating set, r≥1 (i) if ∣N(v)∩S∣=1, (ii) ∣N(u)∩(V − S)∣ ≥1 for every ν ∈ V − S, u ∈ S and = m1Kr ∪ m2Kr−1, where m1, m2 ar

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9e41aa39dff21c1b402c6f7529169d4f
https://doi.org/10.1063/5.0017037

Zobrazit plný text záznamu

Center Smooth Sets and Center Smooth Numbers of Graphs

Autor: A. Anto Kinsley, J. Joan Princiya

Publikováno v: Journal of Physics: Conference Series. 1770:012071

For any proper set S of V in a graph G(V, E), the S-eccentricity, eG, S (υ) (in short eS (υ)) of a vertex υ in G is max x ∈ S ( d ( υ , x ) ) . The S-center of G is CS (G) = {υ ∈ V | eS (x) ≤ e S(x)∀x ∈ V} and S 1-eccentricity, eG,S1 (

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7747d6aabd2cd173fcccd5bf7252675a
https://doi.org/10.1088/1742-6596/1770/1/012071

Zobrazit plný text záznamu

Connected edge rm – distance monophonic number of a graph

Autor: A. Anto Kinsley, M. Shanthi

Publikováno v: Journal of Physics: Conference Series. 1770:012070

Let X be a graph of order at least two, which is connected. In this paper we define a new set called the connected edge rm - distance monophonic set of a graph X. Some properties of the connected edge rm -distance monophonic sets are determined. The

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6984d0b7c6e40a565bced31bfe2fa8c5
https://doi.org/10.1088/1742-6596/1770/1/012070

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání