Documentos de Lascsáková M. | REDI

Regresar

Mostrando 6 resultados de: 6

Filtros aplicados

Área de conocimiento: "Optimización matemática"

Subtipo de publicación

Publisher

AIMS Mathematics(1)

AKCE International Journal of Graphs and Combinatorics(1)

Applied Mathematics and Computation(1)

Ars Combinatoria(1)

Statistics, Optimization and Information Computing(1)

Área temáticas

Ciencias de la computación(5)

Principios generales de matemáticas(2)

Principios generales y formas musicales(1)

Área de conocimiento

Teoría de grafos(6)

Año de Publicación

Origen

Palabras Claves

Irregularity strength(2)

(a, d)-edge-antimagic vertex labeling(1)

(a,d)-H-antimagic graph(1)

(a.d)-edge-nnlimagic total labeling(1)

(modular) irregular labeling(1)

On connection between α-labelings and edge-antimagic labelings of disconnected graphs

Abstract: A labeling of a graph is any map that carries some set of graph elements to numbers (usually to the

Palabras claves:

(a, d)-edge-antimagic vertex labeling, (a.d)-edge-nnlimagic total labeling, Super (a,d)-edgeantimngic total labeling, αLabeling

Lascsáková M., Martin Bača, Semaničova-Fenovciková A.

On entire face irregularity strength of disjoint union of plane graphs

Abstract: A face irregular entire k-labeling of a 2-connected plane graph G is a labeling of vertices, edges a

Palabras claves:

Entire face irregularity strength, Face irregular entire labeling, irregular assignment, Irregularity strength

Lascsáková M., Martin Bača, Naseem M., Semaničova-Fenovciková A.

On fractional metric dimension of comb product graphs

Abstract: 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 o

Palabras claves:

Comb Product, Fractional Metric Dimension, Resolving Function

Lascsáková M., Martin Bača, Saputro S.W., Semaničova-Fenovciková A.

Modular total vertex irregularity strength of graphs

Abstract: A (modular) vertex irregular total labeling of a graph G of order n is an assignment of positive int

Palabras claves:

(modular) irregular labeling, (modular) irregularity strength, (modular) total vertex irregularity strength

Ali G., Aloqaily A., Lascsáková M., Martin Bača, Mlaiki N., Semaničova-Fenovciková A.

Two constructions of H-antimagic graphs

Abstract: Let H be a graph. A graph G=(V,E) admits an H-covering if every edge in E belongs to a subgraph of G

Palabras claves:

(a,d)-H-antimagic graph, Corona of graphs, H-covering, Subdivision of edges, Super (a,d)-H-antimagic graph

Lascsáková M., Martin Bača, Semaničova-Fenovciková A.

The irregularity and modular irregularity strength of fan graphs

Abstract: 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 strength

Kimáková Z., Lascsáková M., Martin Bača, Semaničova-Fenovciková A.