On edge connectivity of direct products of graphs (Q1944162): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090241765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in tensor graph powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the Kronecker product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercubes As Direct Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity of strong products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the bipartite edge frustration of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite automata approach to modeling the cross product of interconnection networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the connectivity of Kronecker products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex vulnerability parameters of Kronecker products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of strong products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3114962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability of interconnection networks modeled by Cartesian product digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:40, 6 July 2024

scientific article
Language Label Description Also known as
English
On edge connectivity of direct products of graphs
scientific article

    Statements

    On edge connectivity of direct products of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    0 references
    combinatorial problems
    0 references
    connectivity
    0 references
    direct product
    0 references
    graph product
    0 references
    separating set
    0 references
    0 references