Mostrando 10 resultados de: 59
Filtros aplicados
Publisher
Electronic Journal of Graph Theory and Applications(8)
Ars Combinatoria(7)
Utilitas Mathematica(7)
Discrete Mathematics(5)
AKCE International Journal of Graphs and Combinatorics(3)
Área temáticas
Principios generales de matemáticas(43)
Álgebra(38)
Ciencias de la computación(21)
Ciencias Naturales y Matemáticas(4)
Física(2)
Área de conocimiento
Teoría de grafos(55)
Optimización matemática(27)
Algoritmo(17)
Desconocido(8)
Ciencias de la computación(5)
Objetivos de Desarrollo Sostenible
ODS 17: Alianzas para lograr los objetivos(50)
ODS 9: Industria, innovación e infraestructura(36)
ODS 4: Educación de calidad(32)
ODS 10: Reducción de las desigualdades(23)
ODS 16: Paz, justicia e instituciones sólidas(18)
Origen
scopus(59)
Edge-antimagic labelings of forests
ArticleAbstract: An (a, d)-edge-antimagic total labeling of a graph G(V, E) is a one-to-one map f from V(G) U E(G) onPalabras claves:Autores:Lin Y., Martin Bača, Muntaner-Batle F.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: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:scopusSome infinite families of Ramsey (P3, Pn)-minimal trees
ArticleAbstract: For any given two graphs G and H, the notation F → (G, H) means that for any red-blue coloring of alPalabras claves:Coloring, Ramsey infinite, Ramsey minimal graph, TreeAutores:Assiyatun H., Martin Bača, Rahmadani D., Semaničova-Fenovciková A., Tbaskoro E.Fuentes:scopusSome open problems on graph labelings
ArticleAbstract: In this note we present a few open problems on various aspects of graph labelings, which have not bePalabras claves:Antimagic total labeling, Chromatic number, Distance antimagic labeling, Graceful labeling, Irregular labeling, α-labelingAutores:Arumugam S., Froncek D., Martin Bača, Ryan J., Sugeng K.A.Fuentes:scopusSuper Face Antimagic Labelings of Union of Antiprisms
ArticleAbstract: In this paper we deal with the problem of labeling the vertices, edges and faces of a disjoint unionPalabras claves:Disjoint union of antiprisms, Plane graph, Super d-Antimagic labelingAutores:Martin Bača, Numan M., Siddiqui M.K.Fuentes:scopusSuper edge-antimagic labeling of a cycle with a chord m. baca
ArticleAbstract: An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping g taking the vertices and edgesPalabras claves:Autores:Martin Bača, Murugan M.Fuentes:scopusWheels are Cycle-Antimagic
ArticleAbstract: A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic toPalabras claves:(Super) (a,d)-H-antimagic total labeling, Cycle-antimagic labeling, H-covering, WheelAutores:Lascsáková M., Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.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: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:scopus