Mostrando 10 resultados de: 46
Filtros aplicados
Publisher
AKCE International Journal of Graphs and Combinatorics(6)
Developments in Mathematics(4)
Electronic Journal of Graph Theory and Applications(3)
Mathematics(3)
Symmetry(3)
Área temáticas
Matemáticas(8)
Principios generales de matemáticas(6)
Física(3)
Álgebra(3)
Ciencias Naturales y Matemáticas(2)
Área de conocimiento
Teoría de grafos(39)
Optimización matemática(29)
Ciencia de materiales(3)
Algoritmo(2)
Ciencias de la computación(2)
Objetivos de Desarrollo Sostenible
ODS 9: Industria, innovación e infraestructura(41)
ODS 17: Alianzas para lograr los objetivos(35)
ODS 4: Educación de calidad(31)
ODS 8: Trabajo decente y crecimiento económico(13)
ODS 11: Ciudades y comunidades sostenibles(1)
Origen
scopus(46)
Computation 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 Vertex-Based Eccentric Topological Descriptors of Zero-Divisor Graph Associated with Commutative Rings
ArticleAbstract: The applications of finite commutative ring are useful substances in robotics and programmed geometrPalabras claves:Autores:Ahmad A., Ahmadini A.A.H., Javaid M., Koam A.N.A., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusAntimagic 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:scopusConstructions of H-antimagic graphs using smaller edge-antimagic graphs
ArticleAbstract: A simple graph G - (V, E) admits an H-covering if every edge in E belongs at least to one subgraph oPalabras claves:(Super) (a,d)-H-antimagic labeling, H-coveringAutores:Dafik D., Martin Bača, Semaničova-Fenovciková A., Slamin, Tanna D.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: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: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:scopusSuper d-Antimagic labelings of disjoint union of generalized prisms
ArticleAbstract: The generalized prism, Pmn can be defined as the Cartesian product of a cycle on n vertices with a pPalabras claves:D-antimagic labeling, Disjoint union of generalized prisms, Plane graph, Super d-Antimagic labelingAutores:Martin Bača, Numan M., Semaničova-Fenovciková A.Fuentes:scopusSuper-vertex-antimagic total labelings of disconnected graphs
ArticleAbstract: Let G = (V, E) be a finite, simple and non-empty (p, q)-graph of order p and size q. An (a, d)-vertePalabras claves:(a, d)-vertex-antimagic total labeling, Disconnected graphs, Super-(a, d)-vertex-antimagic total labelingAutores:Ali G., Lin Y., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopus