Mostrando 10 resultados de: 29
Filtros aplicados
Publisher
Utilitas Mathematica(4)
Ars Combinatoria(3)
AKCE International Journal of Graphs and Combinatorics(2)
Discussiones Mathematicae - Graph Theory(2)
Journal of Discrete Mathematical Sciences and Cryptography(2)
Área temáticas
Ciencias de la computación(22)
Principios generales de matemáticas(9)
Álgebra(4)
Análisis(2)
Matemáticas(2)
Objetivos de Desarrollo Sostenible
ODS 9: Industria, innovación e infraestructura(29)
ODS 17: Alianzas para lograr los objetivos(18)
ODS 4: Educación de calidad(11)
Origen
scopus(29)
(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: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 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: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:scopusEdge-antimagicness for a class of disconnected graphs
ArticleAbstract: Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d)-edge-antimagic total lPalabras claves:Autores:Brankovic L., Martin BačaFuentes:scopusFans are cycle-antimagic
ArticleAbstract: A simple graph G = (V, E) admits an H-covering if every edge in E belongs at least to one subgraph oPalabras claves:Autores:Martin Bača, Ovais A., Semaničova-Fenovciková A., Umar M.A.Fuentes:scopusRainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph
ArticleAbstract: An edge-colored graph G is rainbow k-connected, if for every two vertices of G, there are k internalPalabras claves:Cycle, edge-comb product, Hamiltonian graph, rainbow 2-connectivity, rainbow pathAutores:Martin Bača, Salman A.N.M., Simanjuntak R., Susanti B.Fuentes:scopusModular edge irregularity strength of graphs
ArticleAbstract: For a simple graph G = (V, E) with the vertex set V(G) and the edge set E(G), a vertex labeling ϕ: VPalabras claves:(modular) edge irregularity strength, (modular) irregular labeling, (modular) irregularity strength, caterpillar, Cycle, friendship graph, n-sunAutores:Ahmad A., Koam A.N.A., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusNote on in-antimagicness and out-antimagicness of digraphs
ArticleAbstract: A digraph D is called (a, d)-vertex-in-antimagic ((a, d)-vertex-out-antimagic) if it is possible toPalabras claves:(a, d)-vertex-in-antimagic graph, (a, d)-vertex-out-antimagic graph, 05C20, 05C78, In-regular digraph, Out-regular digraphAutores:Arumugam S., Marr A., Martin Bača, Semaničova-Fenovciková A., Sugeng K.A.Fuentes:scopus