Mostrando 10 resultados de: 21
Filtros aplicados
Publisher
AKCE International Journal of Graphs and Combinatorics(3)
Australasian Journal of Combinatorics(2)
Electronic Journal of Graph Theory and Applications(2)
Journal of the Franklin Institute(2)
Utilitas Mathematica(2)
Área temáticas
Ciencias de la computación(17)
Principios generales de matemáticas(5)
Álgebra(5)
Ciencias Naturales y Matemáticas(4)
Física(2)
Origen
scopus(21)
Colourings of graphs by labellings
ArticleAbstract: In this paper we give a survey on several types of colourings of elements of graphs by different typPalabras claves:irregular colouring, Irregularity strength, proper colouring, total vertex (edge) irregularity strengthAutores:Jendrol’ S., Martin BačaFuentes:scopusAntimagic labeling of disjoint union of s-crowns
ArticleAbstract: A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges byPalabras claves:(a,d)-edge-antimagic total labeling, S-crowns, Super (a,d)-edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusAntimagic labeling of the union of two stars
ArticleAbstract: Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-onePalabras claves:Autores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusAntimagic labelings of hexagonal plane maps
ArticleAbstract: This paper deals with the problem of labeling the edges, vertices and faces of a plane graph in suchPalabras claves:Autores:Jendrol’ S., Martin Bača, Miller M., Tbaskoro E.Fuentes:scopusAntimagic valuations for the special class of plane graphs
Conference ObjectAbstract: We deal with the problem of labeling the vertices, edges and faces of a special class of plane graphPalabras claves:Autores:Martin Bača, Miller M., Tbaskoro E.Fuentes:scopusConstructions of H-antimagic graphs using smaller edge-antimagic graphs
ArticleAbstract: A simple graph G - (V, E) admits an H-covering if every edge in E belongs at least to one subgraph oPalabras claves:(Super) (a,d)-H-antimagic labeling, H-coveringAutores:Dafik D., Martin Bača, Semaničova-Fenovciková A., Slamin, Tanna D.Fuentes:scopusNote on edge irregular reflexive labelings of graphs
ArticleAbstract: For a graph G, an edge labeling fe:E(G)→{1,2,…,ke} and a vertex labeling fv:V(G)→{0,2,4,…,2kv} are cPalabras claves:Cartesian product of cycles, Cycles, Edge irregular reflexive labeling, Reflexive edge strengthAutores:Irfan M., Martin Bača, Ryan J., Semaničova-Fenovciková A., Tanna D.Fuentes:scopusH-irregularity strengths of plane graphs
ArticleAbstract: Graph labeling is the mapping of elements of a graph (which can be vertices, edges, faces or a combiPalabras claves:Face (edge, Face) H-irregularity strength, Face (edge, Face) labeling, Irregularity strength, VertexAutores:Hinding N., Javed A., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusOn (F,H)-sim-magic labelings of graphs
ArticleAbstract: A simple graph G(V,E) admits an H-covering if every edge in G belongs to a subgraph of G isomorphicPalabras claves:(F, Cartesian product, H)-sim-(super)magic, H-(super)magic, H-covering, join productAutores:Ashari Y.F., Martin Bača, Salman A.N.M., Semaničova-Fenovciková A., Simanjuntak R.Fuentes:scopusOn Consecutive labeling of plane graphs
ArticleAbstract: This paper concerns a labeling problem of the plane graphs Pmn. The present paper describes a magicPalabras claves:Autores:Martin BačaFuentes:scopus