On resistance of graphs

On resistance of graphs

An edge-coloring of a graph G with integers is called an interval coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. It is known that not all graphs have interval colorings, and therefore it is expedient to consider a m...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 159; no. 16; pp. 1889 - 1900
Main Authors: Petrosyan, P.A., Sargsyan, H.E.
Format: Journal Article Conference Proceeding
Language:English
Published: Kidlington Elsevier B.V 28-09-2011
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Coloring
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Deficiency
Edge-coloring
Exact sciences and technology
Graph theory
Graphs
Information retrieval. Graph
Integers
Interval coloring
Intervals
Mathematical analysis
Mathematics
Regular graph
Resistance
Sciences and techniques of general use
Theoretical computing
Edge-coloring
Resistance
Interval coloring
Deficiency
Regular graph
Interval graph
Vertex
Edge(graph)
Computer theory
Color
Optimization
Integer
Graph colouring
Combinatorics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An edge-coloring of a graph G with integers is called an interval coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. It is known that not all graphs have interval colorings, and therefore it is expedient to consider a measure of closeness for a graph to be interval colorable. In this paper we introduce such a measure (resistance of a graph) and we determine the exact value of the resistance for some classes of graphs.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2010.11.001