EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 3.0

On Neighbor chromatic number of grid and torus graphs

B. Chaluvaraju, C. Appajigowda

General Mathematics · 2019

DOI: 10.2478/gm-2019-0001 ↗

Kurz gefasst

Fachartikel in der Zeitschrift General Mathematics, 2019. Verfasst von B. Chaluvaraju und 1 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 3.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A set S ⊆ V is a neighborhood set of a graph G = ( V, E ), if G = ∪ v∈S 〈 N [ v ] 〉, where 〈 N [ v ] 〉 is the subgraph of a graph G induced by v and all vertices adjacent to v . A neighborhood set S is said to be a neighbor coloring set if it contains at least one vertex from each color class of a graph G , where color class of a colored graph is the set of vertices having one particular color. The neighbor chromatic number χ n ( G ) is the minimum cardinality of a neighbor coloring set of a graph G . In this article, some results on neighbor chromatic number of Cartesian products of two paths (grid graph) and cycles (torus graphs) are explored.

Zitieren

APA

Chaluvaraju, B., & Appajigowda, C. (2019). On Neighbor chromatic number of grid and torus graphs. General Mathematics. https://doi.org/10.2478/gm-2019-0001

Vancouver

Chaluvaraju B, Appajigowda C. On Neighbor chromatic number of grid and torus graphs. General Mathematics. 2019. doi:10.2478/gm-2019-0001

BibTeX
@article{Chaluvaraju2019,
  author = {Chaluvaraju, B. and Appajigowda, C.},
  title = {On Neighbor chromatic number of grid and torus graphs},
  journal = {General Mathematics},
  year = {2019},
  doi = {10.2478/gm-2019-0001}
}
Kostenlos starten →