A new family of chromatically unique 6-bridge graph

Karim, Nor Suriya Abd; Hasni, Roslan

doi:10.4067/s0716-09172018000200239

Proyecciones (Antofagasta)

2018

DOI: 10.4067/s0716-09172018000200239

|View full text |Cite

A new family of chromatically unique 6-bridge graph

Nor Suriya Abd Karim

Roslan Hasni

Abstract: ) where 2 ≤ a ≤ b ≤ c, is investigated.2000 Mathematical Subject Classification : Primary 05C15.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Vertex neighborhood restricted edge achromatic sums of graphs

Joseph

Dominic

2022

Discrete Math. Algorithm. Appl.

View full text Add to dashboard Cite

The vertex induced 2-edge coloring number [Formula: see text] of a graph [Formula: see text] is the highest number of colors that can occur in an edge coloring of a graph [Formula: see text] such that not more than two colors can be used to color the edges in the induced subgraph [Formula: see text] generated by the closed neighborhood [Formula: see text] of a vertex [Formula: see text] in [Formula: see text]. The vertex induced 2-edge coloring sum of a graph [Formula: see text] denoted as [Formula: see text], is the greatest sum among all the vertex induced 2-edge coloring of a graph [Formula: see text] which concedes [Formula: see text] colors. The vertex incident 2-edge coloring number of a graph [Formula: see text] is the highest number of colors required to color the edges of a graph [Formula: see text] such that not more than two colors can be ceded to the edges incident at the vertex [Formula: see text] of [Formula: see text]. The vertex incident 2-edge coloring sum of a graph [Formula: see text] denoted as [Formula: see text], is the maximum sum among all the vertex incident 2-edge coloring of graph [Formula: see text] which receives maximum [Formula: see text] colors. In this paper, we initiate a study on the vertex induced 2-edge coloring sum and vertex incident 2-edge coloring sum concepts and apply the same to some graph classes. Besides finding the exact values of these parameters, we also obtain some bounds and a few comparative results.

show abstract

Vertex neighborhood restricted edge achromatic sums of graphs

Joseph

Dominic

2022

Discrete Math. Algorithm. Appl.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A new family of chromatically unique 6-bridge graph

Abstract: ) where 2 ≤ a ≤ b ≤ c, is investigated.2000 Mathematical Subject Classification : Primary 05C15.

Cited by 1 publication

References 9 publications

Vertex neighborhood restricted edge achromatic sums of graphs

Vertex neighborhood restricted edge achromatic sums of graphs

Contact Info

Product

Resources

About