Browsing by Author "Marcote Ordax, Francisco Javier"
Now showing items 1-12 of 12
-
A blended learning/teaching methodology case study in the context of the EngiMath@UPC+ innovation project
(International Association of Technology, Education and Development (IATED), 2024)
Conference lecture
Open AccessThe EngiMath@UPC+ project consists of a proposal to introduce an online training material, the main output of the European ERASMUS+ EngiMath project, as a blended learning methodology in a wide range of Linear Algebra ... -
A critical analysis of open educational resources assessment strategies
(International Association of Technology, Education and Development (IATED), 2024)
Conference lecture
Open AccessOpen Educational Resources (OER) play an important role in modern education, providing accessible and adaptable learning materials. Assessing the quality of OER in digital libraries is essential for ensuring their effectiveness ... -
Desenvolupament i implementació d´ Unitats Docents Autocontingudes a les assignatures d’Àlgebra
(Universitat Politècnica de Catalunya. Institut de Ciències de l'Educació, 2010-02-11)
Conference lecture / Conference report
Open AccessEn el curs 2008/2009 s’ha aplicat una metodologia docent nova a l’assignatura d’Àlgebra i Geometria de primer de la titulació d’Enginyeria de Camins. Ha calgut un tipus de material nou que també haurà de servir per a ... -
EngiMath@UPC+: a step forward from online self learning to blended learning
(2024)
Conference lecture
Open AccessThe EngiMath@UPC+ project consists of a proposal to introduce online training material, the main output of the European ERASMUS+ EngiMath project, as a blended learning methodology in a wide range of Linear Algebra ... -
Improving bounds on the order of regular graphs of girth 5
(2019-10-01)
Article
Open AccessA -graph is a -regular graph with girth and a -cage is a -graph with the fewest possible number of vertices . Constructing -cages and determining the order are both very hard problems. For this reason, an intensive line ... -
Mapping OER movements in the field of mathematics
(Universitat Politècnica de València, 2024)
Conference report
Open AccessThe purpose of the paper is to compile a list of initiatives featuring OER developers' work in Austria, Estonia, Portugal, Romania, and Spain, aiming to improve awareness, accessibility, and fostering cooperation in the ... -
On the connectivity of semiregular cages
(2010-08)
Article
Restricted access - publisher's policyAn ({r,r+1};g)-cage is a graph with degree set {r,r+1}, girth g, and with the smallest possible order; every such graph is called a semiregular cage. In this article, semiregular cages are shown to be maximally edge-connected ... -
On the k-restricted edge-connectivity of matched sum graphs
(Iniciativa Digital Politècnica, 2011)
Conference report
Open AccessA matched sum graph $G_1$M$G_2$ of two graphs $G_1$ and $G_2$ of the same order n is obtained by adding to the union (or sum) of $G_1$ and $G_2$ a set M of n independent edges which join vertices in V ($G_1$) to vertices ... -
On the restricted connectivity and superconnectivity in graphs with given girth
(2007-03)
Article
Restricted access - publisher's policyThe restricted connectivity κ′(G)κ′(G) of a connected graph G is defined as the minimum cardinality of a vertex-cut over all vertex-cuts X such that no vertex uu has all its neighbors in X; the superconnectivity κ1(G)κ1(G) ... -
On the size of immune sets in the k-PULL infection model
(Elsevier, 2025-11-15)
Article
Open AccessThis paper addresses immune sets in graphs, which are subsets of nodes that remain unaffected during the spread of influence, failure, or infection. The specific propagation model examined is the $k$-PULL infection rule, ... -
Some properties of semiregular cages
(2010)
Article
Restricted access - publisher's policyA graph with degree set {r,r + 1} is said to be semiregular. A semiregular cage is a semiregular graph with given girth g and the least possible order. First, an upper bound on the diameter of semiregular graphs with girth ... -
The p-restricted edge-connectivity of Kneser graphs
(Elsevier, 2019-02-15)
Article
Open AccessGiven a connected graph G and an integer 1¿=¿p¿=¿¿|V(G)|/2¿, a p-restricted edge-cut of G is any set of edges S¿¿¿E(G), if any, such that is not connected and each component of has at least p vertices; and the p-restricted ...
