Mostrando 9 resultados de: 9
Filtros aplicados
Publisher
AKCE International Journal of Graphs and Combinatorics(2)
Electronic Journal of Graph Theory and Applications(2)
Aequationes Mathematicae(1)
Ars Combinatoria(1)
Developments in Mathematics(1)
Área temáticas
Ciencias de la computación(8)
Ciencias Naturales y Matemáticas(3)
Esclavitud y emancipación(1)
Física(1)
Física aplicada(1)
Origen
scopus(9)
Constructions 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 H-irregularity strength of ladders and fan graphs
ArticleAbstract: We investigate modifications of the well-known irregularity strength of graphs, namely, total (vertePalabras claves:H-irregular labeling, H-irregularity strength, Total (vertex, edge) -irregular labeling, Total (vertex, edge) -irregularity strengthAutores:Ashraf F., Martin Bača, Semaničova-Fenovciková A., Siddiqui M.K.Fuentes:scopusOn H-irregularity strengths of G-amalgamation of graphs
ArticleAbstract: A simple graph G = (V (G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one sPalabras claves:Amalgamation of graphs, Edge) H-irregular labeling, Edge) H-irregularity strength, Total (vertexAutores:Ashraf F., Martin Bača, Semaničova-Fenovciková A., Shabbir A.Fuentes:scopusOn graceful antimagic graphs
ArticleAbstract: A graceful labeling of a graph G is an injective function from the vertex set of G to the set { 0 ,Palabras claves:Antimagic graph, Graceful antimagic graph, Graceful graphAutores:Ahmed M.A., Babujee J.B., Martin Bača, Semaničova-Fenovciková A., Shobana L.Fuentes:scopusMagic and antimagic graphs: Attributes, observations, and challenges in graph labelings
Book PartAbstract:Palabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusTotal Irregularity Strengths of a Disjoint Union of (4,6)-Fullerene Graphs
ArticleAbstract: A fullerene is a polyhedral molecule made entirely of carbon atoms other than graphite and diamond.Palabras claves:(4,6)-Fullerene, Irregularity strength, total edge irregularity strength, total vertex irregularity strengthAutores:Martin Bača, Semaničova-Fenovciková A., Shabbir A.Fuentes:scopus