Mostrando 10 resultados de: 110
Filtros aplicados
Publisher
Utilitas Mathematica(13)
Australasian Journal of Combinatorics(9)
Ars Combinatoria(8)
Developments in Mathematics(7)
AKCE International Journal of Graphs and Combinatorics(5)
Área temáticas
Ciencias de la computación(72)
Matemáticas(20)
Principios generales de matemáticas(20)
Álgebra(12)
Programación informática, programas, datos, seguridad(7)
Objetivos de Desarrollo Sostenible
ODS 9: Industria, innovación e infraestructura(102)
ODS 17: Alianzas para lograr los objetivos(92)
ODS 4: Educación de calidad(86)
ODS 8: Trabajo decente y crecimiento económico(25)
ODS 11: Ciudades y comunidades sostenibles(1)
Origen
scopus(110)
(a, d)-Edge-antimagic total labelings of caterpillars
Conference ObjectAbstract: For a graph G = (V, E), a bijection g from V(G) ∪E(G) into {1,2,..., |V(G)| + |E(G)|} is called (a,Palabras claves:Autores:Martin Bača, Miller M., Slamin, Sugeng K.A.Fuentes:scopusA method to generate large classes of edge-antimagic trees
ArticleAbstract: A (p, q)-graph G is said to be graceful if the vertices can be assigned the labels {1,2,...,q+ 1} suPalabras claves:Edge-antimagic total labeling, Graceful labeling, Tree, α-labelingAutores:Martin Bača, Semaničova-Fenovciková A., Shafiq M.K.Fuentes:scopusA survey of face-antimagic evaluations of graphs
ArticleAbstract: The concept of face-antimagic labeling of plane graphs was introduced by Mirka Miller in 2003. ThisPalabras claves:Autores:Brankovic L., Jendrol’ S., Lin Y., Martin Bača, Phanalasy O., Ryan J., Semaničova-Fenovciková A., Slamin, Sugeng K.A., Tbaskoro E.Fuentes:scopusColourings 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:scopusComputation of edge C <inf>4</inf>-irregularity strength of Cartesian product of graphs
ArticleAbstract: If every edge in the graph G is also an edge of a subgraph of G isomorphic to a given graph H we sayPalabras claves:05C70, 05C78, Edge H-irregularity strength, Generalized prism, Grid graph, H-irregular edge labelingAutores:Ahmad A., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusComputing the metric dimension of Kayak Paddles graph and cycles with chord
ArticleAbstract: A set of vertices Wis a resolving set of a graph G if every two vertices ofG have distinct representPalabras claves:Kayak paddles, Metric dimension, Resolving set, roboticsAutores:Ahmad A., Martin Bača, Sultan S.Fuentes:scopusAntimagic Labelings of Join Graphs
ArticleAbstract: An antimagic labeling of a graph with q edges is a bijection from the set of edges of the graph to tPalabras claves:Antimagic labeling, Complete multipartite graph, Join graphAutores:Martin Bača, Phanalasy O., Ryan J., Semaničova-Fenovciková A.Fuentes: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 generalized Petersen graphs that are plane
ArticleAbstract: We deal with the problem of labeling the vertices, edges and faces of a plane graph in such a way thPalabras claves:Autores:Jendrol’ S., Martin Bača, Miller M., Ryan J.Fuentes:scopus