Ara es mostren els items 1-17 de 17

• #### A new application of the $\otimes_h$-product to $\alpha$-labelings ﻿

(2015)
Article
Accés obert
The weak tensor product was introduced by Snevily as a way to construct new graphs that admit a-labelings from a pair of known a-graphs. In this article, we show that this product and the application to a-labelings can be ...
• #### A note on the degree sequences of graphs with restrictions ﻿

(2008-01-15)
Article
Accés obert
Degree sequences of some types of graphs will be studied and characterized in this paper.
• #### Bi-magic and other generalizations of super edge-magic labelings ﻿

(2011-06-15)
Article
Accés restringit per política de l'editorial
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labelings and optimal k-equitable labelings. We establish, with the help of the product ⊗h, new relations between super edge-magic ...
• #### Bounds on the size of super edge-magic graphs depending on the girth ﻿

(2009-12-13)
Report de recerca
Accés obert
Let G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q 2p−3. Furthermore, if G is super edge-magic and q = 2p−3, then the girth of G is 3. It is also known that if the ...
• #### Connectivity and other invariants of generalized products of graphs ﻿

(2015-02-24)
Article
Accés obert
Figueroa-Centeno et al. [4] introduced the following product of digraphs let D be a digraph and let G be a family of digraphs such that V (F) = V for every F¿G. Consider any function h:E(D)¿G. Then the product D¿hG is the ...
• #### Enumerating super edge-magic labelings for some types of path-like trees ﻿

(2010-06-02)
Article
Accés obert
The main goal of this paper is to use a variation of the Kronecker product of matrices in order to obtain lower bounds for the number of non isomorphic super edge-magic labelings of some types of path-like trees. As a ...
• #### Enumerating super edge-magic labelings for the union of non-isomorphic graphs ﻿

(2011-06-15)
Article
Accés obert
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1 such that: (1) f(u)+f(uv)+f(v)=k for all uv∈E; and (2) f(V )={i}pi=1. Furthermore, when G is a linear forest, the super ...
• #### Labeling Generating Matrices ﻿

(2006-09)
Article
Accés obert
This paper is mainly devoted to generate (special)(super) edge-magic labelings of graphs using matrices. Matrices are used in order to find lower bounds for the number of non-isomorphic (special)(super) edge-magic ...
• #### Langford sequences and a product of digraphs ﻿

(2015-12-07)
Article
Accés restringit per política de l'editorial
Skolem and Langford sequences and their many generalizations have applications in numerous areas. The ¿h-product is a generalization of the direct product of digraphs. In this paper we use the ¿h-product and super edge-magic ...
• #### Magic coverings and the Kronecker product ﻿

(2014-11-01)
Article
Accés restringit per política de l'editorial
In this paper we study a relationship existing among (super) magic coverings and the well known Kronecker product of matrices. We also introduce the concept of Z(n)-property for digraphs in order to study this relation ...
• #### Magic coverings and the Kronecker product ﻿

(2009-12-11)
Article
Accés obert
In this paper we study a relationship existing among (super) magic coverings and the well known Kronecker product of matrices. We also introduce the concept of Zn–property for digraphs in order to study this relation ...
• #### On the structure of path-like trees ﻿

(2007)
Article
Accés obert
We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization ...
• #### Perfect edge-magic graphs ﻿

(2014-01-01)
Article
Accés restringit per política de l'editorial
The study of the possible valences for edge-magic labelings of graphs has motivated us to introduce the concept of perfect edge-magic graphs. Intuitively speaking, an edge-magic graph is perfect edge-magic if all possible ...
• #### Problemas abiertos sobre etiquetamientos super edge-magic y temas relacionados ﻿

(2010)
Text en actes de congrés
Accés obert
El tema de los etiquetamientos de grafos ha experimentado un fuerte impulso en los últimos 40 años, muestra de ello son los dos libros dedicados en exclusiva a ellos, un completísimo artículo ”survey” y más de 1000 ...
• #### Queen Labelings ﻿

(2008)
Article
Accés obert
We introduce and investigate the concept of Queen labeling a digraph and its connection to the well-known n-queens problem. In the general case we obtain an upper bound on the size of a queen graph and show that it is ...
• #### Strong labelings of linear forests ﻿

(2009-11-15)
Article
Accés obert
A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p+q} such that f(u)+f(v)+f(uv) is a constant for each uv ∈ E(G) and f(V (G)) = {1, 2, . . . , p}. In ...
• #### Super edge-magic models ﻿

(2011-04-20)
Article
Accés obert
In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.