Mostrando 8 resultados de: 8
Subtipo de publicación
Article(8)
Publisher
AIMS Mathematics(1)
AKCE International Journal of Graphs and Combinatorics(1)
Applied Mathematics and Computation(1)
Ars Combinatoria(1)
Electronic Notes in Discrete Mathematics(1)
Área temáticas
Ciencias de la computación(6)
Principios generales de matemáticas(2)
Análisis(1)
Economía(1)
Principios generales y formas musicales(1)
Origen
scopus(8)
On connection between α-labelings and edge-antimagic labelings of disconnected graphs
ArticleAbstract: A labeling of a graph is any map that carries some set of graph elements to numbers (usually to thePalabras claves:(a, d)-edge-antimagic vertex labeling, (a.d)-edge-nnlimagic total labeling, Super (a,d)-edgeantimngic total labeling, αLabelingAutores:Lascsáková M., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusOn entire face irregularity strength of disjoint union of plane graphs
ArticleAbstract: A face irregular entire k-labeling of a 2-connected plane graph G is a labeling of vertices, edges aPalabras claves:Entire face irregularity strength, Face irregular entire labeling, irregular assignment, Irregularity strengthAutores:Lascsáková M., Martin Bača, Naseem M., Semaničova-Fenovciková A.Fuentes:scopusOn fractional metric dimension of comb product graphs
ArticleAbstract: A vertex z in a connected graph G resolves two vertices u and v in G if dG(u, z) = dG(v, z). A set oPalabras claves:Comb Product, Fractional Metric Dimension, Resolving FunctionAutores:Lascsáková M., Martin Bača, Saputro S.W., Semaničova-Fenovciková A.Fuentes:scopusModular total vertex irregularity strength of graphs
ArticleAbstract: A (modular) vertex irregular total labeling of a graph G of order n is an assignment of positive intPalabras claves:(modular) irregular labeling, (modular) irregularity strength, (modular) total vertex irregularity strengthAutores:Ali G., Aloqaily A., Lascsáková M., Martin Bača, Mlaiki N., Semaničova-Fenovciková A.Fuentes:scopusTwo constructions of H-antimagic graphs
ArticleAbstract: Let H be a graph. A graph G=(V,E) admits an H-covering if every edge in E belongs to a subgraph of GPalabras claves:(a,d)-H-antimagic graph, Corona of graphs, H-covering, Subdivision of edges, Super (a,d)-H-antimagic graphAutores:Lascsáková M., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusWheels are Cycle-Antimagic
ArticleAbstract: A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic toPalabras claves:(super) (a, d)-H-antimagic total labeling, Cycle-antimagic labeling, H-covering, WheelAutores:Lascsáková M., Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusThe irregularity and modular irregularity strength of fan graphs
ArticleAbstract: For a simple graph G with no isolated edges and at most, one isolated vertex, a labeling ϕ: E(G) → {Palabras claves:fan graph, Irregular labeling, Irregularity strength, modular irregular labeling, modular irregularity strengthAutores:Kimáková Z., Lascsáková M., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusTotal Edge Irregularity Strength of Toroidal Fullerene
ArticleAbstract: A toroidal fullerene (toroidal polyhex) is a cubic bipartite graph embedded on the torus such that ePalabras claves:Edge irregular total labeling, Fullerene, Toroidal polyhex, Total edge irregularitystrengthAutores:Lascsáková M., Martin Bača, Siddiqui M.K.Fuentes:scopus