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)
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:scopusNew Constructions for the n-Queens Problem
ArticleAbstract: Let D be a digraph, possibly with loops. A queen labeling of D is a bijective function l: V(G) ⟶ { 1Palabras claves:(Modular) n-queens problem, (modular) queen labeling, ⊗ -product hAutores:López S., Martin Bača, Muntaner-Batle F., Semaničova-Fenovciková A.Fuentes:scopusNote on in-antimagicness and out-antimagicness of digraphs
ArticleAbstract: A digraph D is called (a, d)-vertex-in-antimagic ((a, d)-vertex-out-antimagic) if it is possible toPalabras claves:(a, d)-vertex-in-antimagic graph, (a, d)-vertex-out-antimagic graph, 05C20, 05C78, In-regular digraph, Out-regular digraphAutores:Arumugam S., Marr A., Martin Bača, Semaničova-Fenovciková A., Sugeng K.A.Fuentes:scopusLabelings of plane graphs containing Hamilton path
ArticleAbstract: This paper deals with the problem of labeling the vertices, edges and faces of a plane graph. A weigPalabras claves:D-antimagic labeling, Hamilton path, Plane graph, Super d-Antimagic labelingAutores:Brankovic L., Martin Bača, 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:scopus