Open Neighborhood Coloring of Prisms | Zendy

Geetha Kempanapura Nanjunda Swamy | Zendy; K. N. Meera | Zendy; Narahari Narasimha Swamy | Zendy; B. Sooryanarayana | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Open Neighborhood Coloring of Prisms

Author(s) -

Geetha Kempanapura Nanjunda Swamy,

K. N. Meera,

Narahari Narasimha Swamy,

B. Sooryanarayana

Publication year - 2014

Publication title -

journal of mathematical and fundamental sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.216

H-Index - 12

eISSN - 2337-5760

pISSN - 2338-5510

DOI - 10.5614/j.math.fund.sci.2013.45.3.4

Subject(s) - combinatorics , mathematics , graph , chromatic scale , windmill graph , undirected graph , simple graph , friendship graph , discrete mathematics , graph power , line graph

For a simple, connected, undirected graph neighbor-hood coloring of the graph for each w V ∈ and ∀ ∈ ( ), f w ( ) w V G ∀ ∈ is called the span of the open neighborhood The minimum span of f the open neighborhood chromatic number of paper, we determine the open neighborhood chromatic number of prism which is a generalized Petersen graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research