Mostrando 10 resultados de: 16
Filtros aplicados
Publisher
Symmetry(3)
Applied Mathematics and Computation(2)
Ars Combinatoria(2)
Electronic Notes in Discrete Mathematics(2)
Discrete Mathematics(1)
Área temáticas
Principios generales de matemáticas(11)
Matemáticas(9)
Ciencias de la computación(8)
Álgebra(6)
Análisis numérico(1)
Área de conocimiento
Teoría de grafos(16)
Optimización matemática(12)
Algoritmo(3)
Ciencias de la Computación(2)
Ciencias de la computación(1)
Objetivos de Desarrollo Sostenible
ODS 9: Industria, innovación e infraestructura(12)
ODS 17: Alianzas para lograr los objetivos(11)
ODS 4: Educación de calidad(9)
ODS 10: Reducción de las desigualdades(4)
ODS 8: Trabajo decente y crecimiento económico(4)
Origen
scopus(16)
A Survey of Irregularity Strength
ArticleAbstract: This survey aims to give an overview of the modifications of the well-known irregular assignments, nPalabras claves:Entire face irregularity strength, face irregular entire k-labeling, Irregularity strength, Plane graphAutores:Jendrol’ S., Kathiresan K., Martin Bača, Muthugurupackiam K., Semaničova-Fenovciková A.Fuentes:scopusThe 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: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:scopusTotal edge irregularity strength of a categorical product of two paths
ArticleAbstract: An edge irregular total k-labeling of a graph G = (V, E) is a labeling f: V ∪ E → {1,2,-,k} such thaPalabras claves:Categorical product, Edge irregular total labeling, Irregularity strength, total edge irregularity strengthAutores:Ahmad A., Martin BačaFuentes:scopusEntire H-irregularity strength of plane graphs
Conference ObjectAbstract: We investigate an entire H-irregularity strength of plane graphs as a modification of the well-knownPalabras claves:Entire face irregularity strength, Entire H-irregularity strength, Irregularity strengthAutores:Hinding N., Javed A., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusColourings of graphs by labellings
ArticleAbstract: In this paper we give a survey on several types of colourings of elements of graphs by different typPalabras claves:irregular colouring, Irregularity strength, proper colouring, total vertex (edge) irregularity strengthAutores:Jendrol’ S., Martin BačaFuentes:scopusH-irregularity strengths of plane graphs
ArticleAbstract: Graph labeling is the mapping of elements of a graph (which can be vertices, edges, faces or a combiPalabras claves:Face (edge, Face) H-irregularity strength, Face (edge, Face) labeling, Irregularity strength, VertexAutores:Hinding N., Javed A., Martin Bača, Semaničova-Fenovciková A.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 irregularity strength, fan graph, Irregularity strength, join of graphs, modular edge-irregular labeling, modular irregular labeling, WheelAutores:Awanis Z.Y., Haryeni D.O., Martin Bača, Semaničova-Fenovciková A.Fuentes: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:scopusOn edge irregularity strength of graphs
ArticleAbstract: For a simple graph G, a vertex labeling :V(G)→{1,2,...,k} is called k-labeling. The weight of an edgPalabras claves:Edge irregularity strength, irregular assignment, Irregular total k-labeling, Irregularity strengthAutores:Ahmad A., Martin Bača, Omar Bin Saeed Al-MushaytFuentes:scopus