Mostrando 5 resultados de: 5
Filtros aplicados
Subtipo de publicación
Article(5)
Publisher
AKCE International Journal of Graphs and Combinatorics(1)
Discussiones Mathematicae - Graph Theory(1)
Electronic Notes in Discrete Mathematics(1)
Mathematics(1)
Symmetry(1)
Área temáticas
Ciencias de la computación(4)
Área de conocimiento
Teoría de grafos(3)
Optimización matemática(2)
Ciencia de materiales(1)
Ingeniería mecánica(1)
Origen
scopus(5)
On Edge H-Irregularity Strengths of Some Graphs
ArticleAbstract: For a graph G an edge-covering of G is a family of subgraphs H1, H2, Ht such that each edge of E(G)Palabras claves:antiprism, diagonal ladder, Edge H-irregularity strength, gear graph, H-irregular edge labeling, prism, triangular ladder, WheelAutores:Ashraf F., Martin Bača, Naeem M., Semaničova-Fenovciková A., Siddiqui M.K.Fuentes:scopusModular Version of Edge Irregularity Strength for Fan and Wheel Graphs
ArticleAbstract: A k-labeling from the vertex set of a simple graph (Formula presented.) to a set of integers (FormulPalabras claves:(modular) edge irregular labeling, (modular) edge irregularity strength, (modular) irregular labeling, fan graph, Irregularity strength, join of graphs, WheelAutores:Awanis Z.Y., Haryeni D.O., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusIrregularity and modular irregularity strength of wheels
ArticleAbstract: It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. ThiPalabras claves:(modular) irregularity strength, irregular assignment, WheelAutores:Imran M., Martin Bača, 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: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:scopus