ICAR Research Data Repository for Knowledge Management
E-3-cordiality of some helm-related graphs
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
E-3-cordiality of some helm-related graphs
|
|
| Creator |
BAPAT, MV
LIMAYE, NB |
|
| Description |
A k-edge labeling of a graph G is a function f : E(G) -> {0, ... , k-1}. Such a labeling induces a labeling on the vertex set V(C) by defining f (v) := Sigma f (e)( mod k), where the summation is taken over all the edges incident on the vertex v. For an edge labeling f, let v(f)(i) ( respectively e f (i)) be the number of vertices (respectively edges) receiving the label i. A graph G is said to be E-k-cordial if there is an k-edge labeling f of G such that, vertical bar v(f) (i) - v(f) (j)vertical bar
|
|
| Publisher |
CHARLES BABBAGE RES CTR
|
|
| Date |
2016-01-15T10:57:53Z
2016-01-15T10:57:53Z 2015 |
|
| Type |
Article
|
|
| Identifier |
ARS COMBINATORIA, 119,429-443
0381-7032 http://dspace.library.iitb.ac.in/jspui/handle/100/18405 |
|
| Language |
en
|
|