Now showing items 1-20 of 212

    • Open problems involving super edge-magic labelings and related topics 

      López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Institute of Combinatorics and its Applications, 2012)
      Graph labelings has experimented a fast development during the last four decades. Two books dedicated to this topic, a very complete survey on the subject and over 1000 papers in the literature constitute a good proof of ...
    • Super edge-magic models 

      López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Springer, 2011)
      In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.
    • Enumerating super edge-magic labelings for the union of nonisomorphic graphs 

      Ahmad, Ali; López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Cambridge University Press, 2011)
      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 ...
    • Integrability of planar nilpotent differential systems through the existence of an inverse integrating factor 

      Algaba, Antonio; García, Cristóbal; Giné, Jaume (Elsevier, 2019)
      In this work is characterized the analytic integrability problem around a nilpotent singularity for differential systems in the plane under generic conditions. The analytic integrability problem is characterized via the ...
    • Analytic integrability around a nilpotent singularity 

      Algaba, Antonio; García, Cristóbal; Giné, Jaume (Elsevier, 2019)
      In this work it is characterized the analytic integrability problem around a nilpotent singularity of a differential system in the plane under generic conditions.
    • Characterizing identifying codes from the spectrum of a graph or digraph 

      Balbuena, C.; Dalfó, Cristina; Martínez Barona, B. (Elsevier, 2019)
      A (1, ≤ ℓ)-identifying code in digraph D is a dominating subset C of vertices of D, such that all distinct subsets of vertices of D with cardinality at most ℓ have distinct closed in-neighborhoods within C. As far as we ...
    • Aligning Business Processes With the Services Layer Using a Semantic Approach 

      Sosa-Sánchez, Encarna; Clemente, Pedro J.; Prieto, Álvaro E.; Ortiz-Caraballo, Carmen (Institute of Electrical and Electronics Engineers (IEEE), 2019)
      Organizations require their business processes goals and the underlying information technology (IT) to be in synchronization with each other, but the continual changes in business processes makes this difficult. To accomplish ...
    • Graphs, friends and acquaintances 

      Dalfó, Cristina; Fiol, Miguel Angel (Faculty of Mathematics and Natural SciencesInstitut Teknologi Bandung (ITB) IndonesiaIndonesian Combinatorial Society (InaCombS)GTA Research GroupGTA Research Group, 2018)
      A graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Many of the first results concerning graphs made reference to relationships between groups of people. ...
    • Análisis de las actitudes y conocimientos estadísticos elementales en la formación del profesorado 

      Estrada Roca, M. Asunción; Batanero, Carmen; Fortuny, Josep Maria (Universidad Autónoma de Madrid, 2006)
      Resumimos la tesis doctoral de Dña Assumpta Estrada Roca, dirigida por Carmen Batanero y Josep María Fortuny, y presentada en la Universidad Autónoma de Barcelona en septiembre de 2002, reflexionando sobre las implicaciones ...
    • The Manhattan Product of Digraphs 

      Comellas, Francesc; Dalfó, Cristina; Fiol, Miguel Angel (Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2013)
      We study the main properties of a new product of bipartite digraphs which we call Manhattan product. This product allows us to understand the subjacent product in the Manhattan street networks and can be used to built other ...
    • The (∆,D) and (∆,N) problems in double-step digraphs with unilateral distance 

      Dalfó, Cristina; Fiol, Miguel Angel (Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2014)
      We study the (Delta,D) and (Delta,N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, obtained by ...
    • On Middle Cube Graphs 

      Dalfó, Cristina; Fiol, Miguel Angel; Mitjana, Margarida (Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2015)
      We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The ...
    • The cubic polynomial differential systems with two circles as algebraic limit cycles 

      Giné, Jaume; Llibre, Jaume; Valls, Claudia (Walter de Gruyter GmbH, 2018)
      In this paper we characterize all cubic polynomial differential systems in the plane having two circles as invariant algebraic limit cycles.
    • From Subkautz Digraphs to Cyclic Kautz Digraphs 

      Dalfó, Cristina (World Scientific Publishing, 2018)
      Kautz digraphs K(d, l) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d, l) were recently introduced by ...
    • A survey on the missing Moore graph 

      Dalfó, Cristina (Elsevier, 2019)
      This is a survey on some known properties of the possible Moore graph (or graphs) ϒ with degree 57 and diameter 2. Moreover, we give some new results about it, such as the following. When we consider the distance partition ...
    • A new general family of mixed graphs 

      Dalfó, Cristina (Elsevier, 2019)
      A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the cycle prefix digraphs. The obtained graphs are vertex transitive and, for some values of the parameters, they constitute ...
    • A blow-up method to prove formal integrability for some planar differential systems 

      Fercec, Brigita; Giné, Jaume (Shanghai Normal University & Wilmington Scientific Publisher, 2018)
      In this work we provide an effective method to prove the formal integrability of the resonant saddles. The method is based on the use of a blow-up and the resolution of a recurrence differential equation using induction. ...
    • Period annulus of the harmonic oscillator with zero cyclicity under perturbations with a homogeneous polynomial field 

      García, I. A. (Isaac A.); Maza Sabido, Susana (Bolyai Institute. University of SzegedHungarian Academy of Sciences, 2019-01-14)
      In this work we prove, using averaging theory at any order in the small perturbation parameter, that the period annulus of the harmonic oscillator has cyclicity zero (no limit cycles bifurcate) when it is perturbed by any ...
    • Iterated line digraphs are asymptotically dense 

      Dalfó, Cristina (Elsevier, 2017)
      We show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymptotically large order for a given diameter (or with small diameter for a given order). This is a well-known result for ...
    • The spectra of subKautz and cyclic Kautz digraphs 

      Dalfó, Cristina (Elsevier, 2017)
      Kautz digraphs K(d, `) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz CK(d, `) and the subKautz sK(d, 2) digraphs were ...