Bull. Malays. Math. Sci. Soc.

2015

DOI: 10.1007/s40840-015-0207-0

|View full text |Cite

|

Sign up to set email alerts

|

Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree

¹

,

²

,

³

Abstract: A proper edge-k

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

0

Mentioning

1

Contrasting

0

Year Published

2015

2015

2021

2021

Publication Types

Select...

Article6

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 8 publications

(1 citation statement)

References 16 publications

Supporting

0

Mentioning

1

Contrasting

0

Order By: Relevance

“…Later, Gao et al [9] showed that if G is a normal graph with ( ) [11] proved that if G is a normal graph with ( )…”

Section: Introductionmentioning

confidence: 99%

Neighbor Sum Distinguishing Index of Graphs with Maximum Average Degree

Sun¹

2021

View full text Add to dashboard Cite

A proper k-edge coloring of a graph)no two adjacent edges receive the same color. A neighbor sum distinguishing k-edge coloring of G is a proper k-edge coloring of G such that ( ) ( ) u e v e c e c e ∈ ∈ ≠ ∑ ∑ for each edge ( ) uv E G ∈ . The 37 12 mad G < . Our approach is based on the discharging method and Combinatorial Nullstellensatz.

“…Later, Gao et al [9] showed that if G is a normal graph with ( ) [11] proved that if G is a normal graph with ( )…”

Section: Introductionmentioning

confidence: 99%

Neighbor Sum Distinguishing Index of Graphs with Maximum Average Degree

Sun¹

2021

View full text Add to dashboard Cite

A proper k-edge coloring of a graph)no two adjacent edges receive the same color. A neighbor sum distinguishing k-edge coloring of G is a proper k-edge coloring of G such that ( ) ( ) u e v e c e c e ∈ ∈ ≠ ∑ ∑ for each edge ( ) uv E G ∈ . The 37 12 mad G < . Our approach is based on the discharging method and Combinatorial Nullstellensatz.

On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree

¹

,

²

2017

Graphs and Combinatorics

View full text Add to dashboard Cite

A proper edge k-colouring of a graph G = (V, E) is an assignment c : E → {1, 2, . . . , k} of colours to the edges of the graph such that no two adjacent edges are associated with the same colour. A neighbour sum distinguishing edge k-colouring, or nsd k-colouring for short, is a proper edge k-colouring such that e∋u c(e) = e∋v c(e) for every edge uv of G. We denote by χ ′ (G) the neighbour sum distinguishing index of G, which is the least integer k such that an nsd k-colouring of G exists.

Neighbor sum distinguishing colorings of graphs with maximum average degree less than $$\tfrac{{37}} {{12}}$$3712

¹

,

²

,

³

2017

Acta. Math. Sin.-English Ser.

View full text Add to dashboard Cite

No 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

hi@scite.ai

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

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

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

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.