[PDF] Top 20 Generalizaciones del concepto de métrica

... An graceful labeling f of a graph G with q edges is an injective function from the set of vertices of G to the set {0,1,2,…,q} such that when each edge xy is assigned the label |f(x)-f(y)| , the resulting ... See full document

... Criminal Activity depends upon the place and time. The Spatio-temporal behavior of the criminal activity can be studied in many categories. Criminal activity generally does not occur in day-light except metropolitan ... See full document

... Makadia, Graceful labeling for Open Star of graphs, ...Makadia, Graceful Labeling for tensor product ot two path of odd lengths and some grid related graphs, ... See full document

... of Graceful Graphs in the field of Computer Science, namely, MULTI PROTOCOL LABEL MPLS) related to ...of graceful labeling concept in Computer Networks via ... See full document

... “ Graceful labeling “was introduced by Rosa ...Fibonacci graceful graphs. A Fibonacci graceful labeling and Super Fibonacci graceful labeling have been introduced ... See full document

... even graceful labeling is a new type of labeling since it was introduced in 2017 by Elsonbaty and Daoud (Ars Combinatoria 130:79–96, ...even graceful labeling for some ... See full document

... graph labeling and graceful graphs was introduced by ...odd graceful graphs and she has proved many ...and graphs obtained fromthem by subdividing each step exactly ...graph ... See full document

... difference labeling,if there exists a bijectionf:v(G)→{0,1,2,…,p} such that the induced function f* : E(G) → N given by f*(uv) =| [f(u)]3 - [f(v)]3 | for everyuv∈ E(G) are all ...difference labeling is ... See full document

... edge labeling of a graph is a bijection from E(G) to the set {1,2,… , ...edge labeling is called antimagic ...antimagic labeling for some path and cycle related ... See full document

... cordial labeling for shadow graph of cycle Cn ...cordial labeling while the same authors in [7] have obtained some new results on product cordial ...cordial labeling in the context of tensor ... See full document

... of graphs, B.D.Acharya defined Set indexer,set graceful and set sequential graphs in ...set graceful graph and found some classes of set graceful ... See full document

... Theorem 2.6. The graph K 2 + mK 1 is not an adjacent edge graceful graph. Proof: Let G = K 2 + mK 1 . Let V ( G ) = { u , v , w i : 1 ≤ i ≤ m } . Let E ( G ) = { e i = uw i , e m + i = vw i : 1 ≤ i ≤ m ; e 2 m + 1 ... See full document

... Cordial Labeling of DS(Pn), DS(DFn), Edge duplication in K 1,n , Joint sum of Gl(n), DFn K 1,n and ringsum of star graph with cycle with one chord and cycle with two chords ... See full document

... antimagic labeling of type (1, 1, 1) for d ∈ {2, 4, 5, 6}. The d-antimagic labeling of type (1, 1, 1) for D n and for several n  7 are described in ... See full document

... cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is such that the number of edges with label 0 and the number of edges ... See full document

... difference labeling is called cube difference ...difference labeling of some helm and wheel related graphs, such as switching of rim vertices of wheel, apex vertex in helm, duplication ... See full document

... to the next six vertices and so on. Next fix the labels 1,1,1,3 to the vertices v 1 , v 2 , v 3 , v 4 respectively. Then assign the labels 2,1,3,1,1,3 to the next six vertices v 5 , v 6 . . . v 10 respec- tively. Assign ... See full document

... cordial labeling of the graphs such as butterfly graph, W-graph, H-graph and duplication of edges of an ...the graphs such as H ʘ K 1 , path union of r copies of H- graph, cycle union of r copies of ... See full document

... sum labeling, it is called a pair sum graph. Analogous to pair sum labeling we defined a new labeling called edge pair sum labeling [3] and further studied in ...the graphs GL(n), ... See full document

... [11] S K Vaidya, G V Ghodasara, Sweta Srivastav, V J Kaneria, “Some new cordial graphs”, Int. J. of scientific comp. 2(1), pp. 81-92, 2008. [12] S K Vaidya, Sweta Srivastav, G V Ghodasara, V J Kaneria, ... See full document