Mostrando 10 resultados de: 13
Filtros aplicados
Publisher
Acta Mathematica Sinica, English Series(2)
Journal of the Franklin Institute(2)
Ars Combinatoria(1)
Australasian Journal of Combinatorics(1)
Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie(1)
Área temáticas
Ciencias de la computación(8)
Principios generales de matemáticas(7)
Matemáticas(5)
Física aplicada(1)
Ingeniería y operaciones afines(1)
Objetivos de Desarrollo Sostenible
ODS 9: Industria, innovación e infraestructura(13)
ODS 17: Alianzas para lograr los objetivos(12)
ODS 4: Educación de calidad(10)
ODS 8: Trabajo decente y crecimiento económico(4)
Origen
scopus(13)
(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: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:scopusEdge-antimagic total labelings
Book PartAbstract: This chapter focuses on edge-antimagic graphs under both vertex labelings and total labelings. SuperPalabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusStrong labelings of linear forests
ArticleAbstract: A (p, q)-graph G is called super edge-magic if there exists a bijective function f: V (G) → E(G) → {Palabras claves:Linear forest, Path-like tree, Strong super edge magic labelingAutores:Lin Y., Martin Bača, Muntaner-Batle F., Rius-Font M.Fuentes:scopusThe metric dimension of regular bipartite graphs
ArticleAbstract: A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distaPalabras claves:Basis, Bipartite graph, Metric dimension, Regular graphAutores:Martin Bača, Salman A.N.M., Saputro S.W., Suprijanto D., Tbaskoro E.Fuentes:scopusThe metric dimension of the lexicographic product of graphs
ArticleAbstract: A set of vertices W resolves a graph G if every vertex is uniquely determined by its coordinate of dPalabras claves:Basis, Lexicographic product, Metric dimension, Resolving setAutores:Assiyatun H., Martin Bača, Salman A.N.M., Saputro S.W., Simanjuntak R., Tbaskoro E., Uttunggadewa S.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:scopusOn Edge Irregular Total Labeling of Categorical Product of Two Cycles
ArticleAbstract: An edge irregular total k-labeling φ:V(G)∪E(G)→{1,2,...,k} of a graph G=(V,E) is a labeling of vertiPalabras claves:Edge irregular total labeling, Irregularity strength, The categorical product of cycles, total edge irregularity strengthAutores:Ahmad A., Martin Bača, Siddiqui M.K.Fuentes:scopusOn connection between α-labelings and edge-antimagic labelings of disconnected graphs
ArticleAbstract: A labeling of a graph is any map that carries some set of graph elements to numbers (usually to thePalabras claves:(a, d)-edge-antimagic vertex labeling, (a.d)-edge-nnlimagic total labeling, Super (a,d)-edgeantimngic total labeling, αLabelingAutores:Lascsáková M., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopus