Now showing items 1-7 of 7

• #### 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 Access
En 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 ...
• #### Improving bounds on the order of regular graphs of girth 5 ﻿

(2019-10-01)
Article
Open Access
A -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 ...
• #### On the connectivity of semiregular cages ﻿

(2010-08)
Article
Restricted access - publisher's policy
An ({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 Access
A 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 policy
The 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) ...
• #### Some properties of semiregular cages ﻿

(2010)
Article
Restricted access - publisher's policy
A 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 Access
Given 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 ...