Mostrando 10 resultados de: 14
Subtipo de publicación
Article(14)
Publisher
Ars Combinatoria(2)
UPB Scientific Bulletin, Series A: Applied Mathematics and Physics(2)
Acta Mathematica Sinica, English Series(1)
Acta Mathematica Universitatis Comenianae(1)
Australasian Journal of Combinatorics(1)
Área temáticas
Ciencias de la computación(9)
Matemáticas(2)
Principios generales de matemáticas(2)
Geometría(1)
Ingeniería y operaciones afines(1)
Área de conocimiento
Optimización matemática(13)
Teoría de grafos(11)
Algoritmo(1)
Matemáticas discretas(1)
Origen
scopus(14)
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: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:scopusComputing the metric dimension of Kayak Paddles graph and cycles with chord
ArticleAbstract: A set of vertices Wis a resolving set of a graph G if every two vertices ofG have distinct representPalabras claves:Kayak paddles, Metric dimension, Resolving set, roboticsAutores:Ahmad A., Martin Bača, Sultan S.Fuentes:scopusOn Edge Irregular Total Labeling of Categorical Product of Two Cycles
ArticleAbstract: An edge irregular total k-labeling φ:V(G)∪E(G)→{1,2,...,k} of a graph G=(V,E) is a labeling of vertiPalabras claves:Edge irregular total labeling, Irregularity strength, The categorical product of cycles, total edge irregularity strengthAutores:Ahmad A., Martin Bača, Siddiqui M.K.Fuentes:scopusOn edge irregularity strength of Toeplitz graphs
ArticleAbstract: An edge irregular k-labeling of a graph G is a labeling of the vertices of G with labels from the sePalabras claves:Edge irregularity strength, irregular assignment, Irregularity strength, Toeplitz graphsAutores:Ahmad A., Martin Bača, Nadeem M.F.Fuentes:scopusOn the minimal doubly resolving sets of harary graph
ArticleAbstract: Let G = (V, E) be a simple connected and undirected graph, where V and E represent the vertex and edPalabras claves:Harary graph, Metric dimension, Minimal doubly resolving set, Resolving setAutores:Ahmad A., Martin Bača, Sultan S.Fuentes:scopusOn vertex irregular total labelings
ArticleAbstract: A vertex irregular total labeling σ of a graph G is a labeling of vertices and edges of G with labelPalabras claves:Circulant graph, Jahangir graph, total vertex irregularity strength, Vertex irregular total labelingAutores:Ahmad A., Martin BačaFuentes:scopusMINIMAL DOUBLY RESOLVING SETS OF ANTIPRISM GRAPHS AND MOBIUS LADDERS
ArticleAbstract: Consider a simple connected graph G = (V(G),E(G)), where V(G) represents the vertex set and E(G) repPalabras claves:Antiprism graph, Metric dimension, Minimal doubly resolving set, Mobius ladder., Resolving setAutores:Ahmad A., Imran M., Martin Bača, Sultan S.Fuentes:scopusMinimal doubly resolving sets of necklace graph
ArticleAbstract: Consider a simple connected undirected graph G = (V;E), where V represents the vertex set and E reprPalabras claves:Metric dimension, Minimal doubly resolving set, Necklace graph, Resolving setAutores:Ahmad A., Martin Bača, Sultan S.Fuentes:scopus