Mostrando 10 resultados de: 12
Filtros aplicados
Publisher
Developments in Mathematics(4)
AKCE International Journal of Graphs and Combinatorics(2)
Australasian Journal of Combinatorics(1)
Bulletin of the Australian Mathematical Society(1)
Journal of Combinatorial Mathematics and Combinatorial Computing(1)
Área temáticas
Matemáticas(4)
Álgebra(3)
Principios generales de matemáticas(2)
Esclavitud y emancipación(1)
Ingeniería civil(1)
Origen
scopus(12)
Antimagic 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: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-magic total labelings
Book PartAbstract: After vertex magic total labelings, this chapter has a focus on edge magic total labelings. LabelingPalabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusOn antimagic labelings of disjoint union of complete s-partite graphs
Conference ObjectAbstract: By an (a, d)-edge-antimagic total labeling of a graph G(V, E) we mean a bijective function f from V(Palabras claves:(a,d)-edge-antimagic total labeling, Complete s-partite graph, Super (a, d) -edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusOn edge irregular reflexive labellings for the generalized friendship graphs
ArticleAbstract: We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known aPalabras claves:Cycles, Edge irregular reflexive labelling, Generalized friendship graph, Reflexive edge strengthAutores:Irfan M., Martin Bača, Ryan J., Semaničova-Fenovciková A., Tanna D.Fuentes:scopusOn h-antimagicness of disconnected graphs
ArticleAbstract: A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph oPalabras claves:(super) (a, d)-H-antimagic labelling, and phrases H-covering, union of graphsAutores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.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:scopusVertex irregular reflexive labeling of prisms and wheels
ArticleAbstract: For a graph (Formula presented.) we define (Formula presented.) -labeling (Formula presented.) suchPalabras claves:fan graph, prism, Reflexive vertex strength, Vertex irregular reflexive labeling, WheelAutores:Martin Bača, Ryan J., Semaničova-Fenovciková A., Tanna D.Fuentes:scopus