Mostrando 10 resultados de: 87
Filtros aplicados
Publisher
Utilitas Mathematica(9)
AKCE International Journal of Graphs and Combinatorics(7)
Australasian Journal of Combinatorics(7)
Ars Combinatoria(4)
Developments in Mathematics(4)
Área temáticas
Matemáticas(17)
Principios generales de matemáticas(11)
Álgebra(8)
Física(4)
Ciencias Naturales y Matemáticas(3)
Área de conocimiento
Teoría de grafos(72)
Optimización matemática(52)
Ciencia de materiales(4)
Algoritmo(3)
Ciencias de la computación(2)
Origen
scopus(87)
Colourings 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:scopusComputation 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:scopusComputing edge irregularity strength of complete m-ary trees using algorithmic approach
ArticleAbstract: Algorithms help in solving many problems, where other mathematical solutions are very complex or impPalabras claves:ALGORITHMS, Complete m-ary tree T m,h, Edge irregularity strengthAutores:Ahmad A., Asim M.A., Hasni R., Martin BačaFuentes: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:scopusAntimagic labeling of disjoint union of s-crowns
ArticleAbstract: A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges byPalabras claves:(a,d)-edge-antimagic total labeling, S-crowns, Super (a,d)-edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusAntimagic labeling of the union of two stars
ArticleAbstract: Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-onePalabras claves:Autores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusAntimagic labelings of grids
ArticleAbstract: In this paper we deal with the problem of labeling the vertices, edges and faces of a grid graph byPalabras claves:Antimagic labeling, Face weight, Graph labeling, Grid, Labeling of type (1,1,1)Autores:Lin Y., Martin Bača, Miller M.Fuentes:scopusAntimagic labelings of hexagonal plane maps
ArticleAbstract: This paper deals with the problem of labeling the edges, vertices and faces of a plane graph in suchPalabras claves:Autores:Jendrol’ S., Martin Bača, Miller M., Tbaskoro E.Fuentes:scopusAntimagic valuations of generalized Petersen graphs
ArticleAbstract: A connected graph G is said to be (a, d)-antimagic, for some positive integers a and d, if its edgesPalabras claves:Autores:Martin Bača, Miller M.Fuentes:scopus