Mostrando 8 resultados de: 8
Filtros aplicados
Subtipo de publicación
Article(8)
Publisher
Electronic Journal of Graph Theory and Applications(3)
AIMS Mathematics(2)
Discrete Mathematics Letters(1)
Mathematics(1)
Symmetry(1)
Área temáticas
Principios generales de matemáticas(5)
Ciencias de la computación(4)
Álgebra(4)
Matemáticas(3)
Economía(1)
Área de conocimiento
Teoría de grafos(7)
Optimización matemática(5)
Algoritmo(3)
Ciencia de materiales(1)
Desconocido(1)
Objetivos de Desarrollo Sostenible
ODS 17: Alianzas para lograr los objetivos(6)
ODS 10: Reducción de las desigualdades(4)
ODS 16: Paz, justicia e instituciones sólidas(4)
ODS 9: Industria, innovación e infraestructura(4)
ODS 4: Educación de calidad(3)
Origen
scopus(8)
The irregularity and modular irregularity strength of fan graphs
ArticleAbstract: For a simple graph G with no isolated edges and at most, one isolated vertex, a labeling ϕ: E(G) → {Palabras claves:fan graph, Irregular labeling, Irregularity strength, modular irregular labeling, modular irregularity strengthAutores:Kimáková Z., Lascsáková M., 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:irregular assignment, modular irregularity strength, WheelAutores:Imran M., Martin Bača, Semaničova-Fenovciková A.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, caterpillar, Cycle, friendship graph, modular irregular labeling, modular irregularity strength, n-sunAutores:Ahmad A., Koam A.N.A., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusModular irregularity strength on some flower graphs
ArticleAbstract: Let G = (V (G),E(G)) be a graph with the nonempty vertex set V (G) and the edge set E(G). Let Z<inf>Palabras claves:daisy graphs, modular irregular labeling, modular irregularity strength, rose graphs, sunflower graphsAutores:Anwar L.F., John P., Lawrence M.L., Martin Bača, Semaničova-Fenovciková A., Sugeng K.A.Fuentes:scopusModular total vertex irregularity strength of graphs
ArticleAbstract: A (modular) vertex irregular total labeling of a graph G of order n is an assignment of positive intPalabras claves:(modular) total vertex irregularity strength, modular irregular labeling, modular irregularity strengthAutores:Ali G., Aloqaily A., Lascsáková M., Martin Bača, Mlaiki N., Semaničova-Fenovciková A.Fuentes:scopusModular irregularity strength of the corona product of graphs
ArticleAbstract: Let G(V, E) be a graph of order n. A modular irregular labeling of G is an edge k-labeling φ: E(G) →Palabras claves:corona product of graphs, modular irregular labeling, modular irregularity strength, Regular graphAutores:Martin Bača, Semaničova-Fenovciková A., Sugeng K.A., Zeveliano Zidane BarackFuentes:scopusModular irregularity strength of dense graphs
ArticleAbstract: We solve the open problem posed in Modular irregularity strength of graphs, Electron. J. Graph TheorPalabras claves:complete bipartite graph, complete graph, Irregular labeling, modular irregularity strengthAutores:Made Candiasa, Martin Bača, Suparta I.N., Wahyudi A. PrasancikaFuentes:scopusModular irregularity strength of graphs
ArticleAbstract: We introduce a modular irregularity strength of graphs as modification of the well-known irregularitPalabras claves:Irregular labeling, Irregularity strength, modular irregular labeling, modular irregularity strengthAutores:Kathiresan K., Martin Bača, Muthugurupackiam K., S. RamyaFuentes:scopus