On resolving edge colorings in graphs
We study the relationships between the resolving edge chromatic number and other graphical parameters and provide bounds for the resolving edge chromatic number of a connected graph.
Saved in:
Main Authors: | Varaporn Saenpholphat, Ping Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2003-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/S0161171203211492 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computing Edge Version of Resolvability and Double Resolvability of a Graph
by: Muhammad Ahmad, et al.
Published: (2022-01-01) -
Retracted: Computing Edge Version of Resolvability and Double Resolvability of a Graph
by: Journal of Chemistry
Published: (2023-01-01) -
On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs
by: Dalal Alrowaili, et al.
Published: (2022-01-01) -
Maximum Colored Cuts in Edge-Colored Complete Graphs
by: Huawen Ma
Published: (2022-01-01) -
List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
by: Wenwen Zhang
Published: (2021-01-01)