Mostrando 9 resultados de: 9
Filtros aplicados
Subtipo de publicación
Article(9)
Publisher
UPB Scientific Bulletin, Series A: Applied Mathematics and Physics(2)
Ars Combinatoria(1)
Australasian Journal of Combinatorics(1)
Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie(1)
Journal of Discrete Mathematical Sciences and Cryptography(1)
Área de conocimiento
Optimización matemática(8)
Teoría de grafos(7)
Algoritmo(1)
Matemáticas discretas(1)
Origen
scopus(9)
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: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: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:scopusIrregular total labeling of disjoint union of prisms and cycles
ArticleAbstract: We investigate two modifications of the well-known irregularity strength of graphs, namely, a totalPalabras claves:Autores:Ahmad A., Martin Bača, Siddiqui M.K.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:scopusTotal vertex irregularity strength of certain classes of unicyclic graphs
ArticleAbstract: A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G withPalabras claves:Cycles, Kite graphs, Paths, STARS, total vertex irregularity strength, Vertex irregular total k-labelingAutores:Ahmad A., Bashir Y., Martin BačaFuentes:scopus