Mostrando 10 resultados de: 10
Filtros aplicados
Subtipo de publicación
Article(10)
Publisher
Ars Combinatoria(2)
Acta Mathematica Sinica, English Series(1)
Australasian Journal of Combinatorics(1)
Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie(1)
Mathematical Problems in Engineering(1)
Área temáticas
Ciencias de la computación(7)
Geometría(1)
Matemáticas(1)
Programación informática, programas, datos, seguridad(1)
Área de conocimiento
Optimización matemática(9)
Teoría de grafos(8)
Algoritmo(1)
Matemáticas discretas(1)
Objetivos de Desarrollo Sostenible
ODS 9: Industria, innovación e infraestructura(10)
ODS 17: Alianzas para lograr los objetivos(8)
ODS 8: Trabajo decente y crecimiento económico(2)
Origen
scopus(10)
Computing 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: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: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: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: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:scopusVertex-antimagic labelings of regular graphs
ArticleAbstract: Let G = (V,E) be a finite, simple and undirected graph with p vertices and q edges. An (a, d)-vertexPalabras claves:Regular graph, Super vertex-antimagic total labeling, vertex-antimagic edge labelingAutores:Ahmad A., Ali K., Kovář P., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopus