Connectivity of generalized prisms over G (Q804591): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677514 / rank
 
Normal rank

Latest revision as of 16:16, 21 June 2024

scientific article
Language Label Description Also known as
English
Connectivity of generalized prisms over G
scientific article

    Statements

    Connectivity of generalized prisms over G (English)
    0 references
    0 references
    0 references
    1991
    0 references
    Let G be a graph on n vertices and \(\alpha \in S_ n\), the symmetric group on \(\{\) 1,2,...,n\(\}\). Then \(\alpha\) (G), \(\alpha\)-generalized prism over G consists of two copies of G, \(G_ x\), \(G_ y\), with \(V(G_ x)=\{x_ 1,...,x_ n\}\), \(V(G_ y)=\{y_ 1,...,y_ n\}\) together with edges \((x_ i,y_{\alpha (i)})\). The main result of the paper says that for any G and arbitrary \(\alpha \in S_ n\), the connectivity of \(\alpha\) (G) is larger than the connectivity of G.
    0 references
    prism
    0 references
    communication network
    0 references
    connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers