Exploració per tema "Grafs de lligam"
Ara es mostren els items 1-3 de 3
-
A sufficient condition for Pk-path graphs being r-connected
(2007-08)
Article
Accés obertGiven an integer k≥1 and any graph G; the path graph $P_k(G)$ has for vertices the paths of length k in G, and two vertices are joined by an edge if and only if the intersection of the corresponding paths forms a path of ... -
On the connectivity and superconnected graphs with small diameter
(2010-03-06)
Article
Accés restringit per política de l'editorialIn this paper, first we prove that any graph G is 2-connected if diam (G)≤ g-1 for even girth g, and for odd girth g and maximum degree $\Delta$ ≤ 2$\delta$-1 where $\delta$ is the minimum degree. Moreover, we prove that ... -
On the vulnerability of some families of graphs
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertThe toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all cutsets S of vertices of G and ω(G − S) denotes the number of components of the resultant graph G − S by ...
