A New Property of Hamming Graphs and Mesh of d-ary Trees (Q3597988): 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.1007/978-3-540-87827-8_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1540302009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric and semisymmetric graphs construction using G-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(G\)-graphs: a new representation of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism group computation and isomorphism testing in finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing conjugacy class representatives in permutation groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods for using Cayley graphs in interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing graphs with several pseudosimilar vertices or edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier transform for fitness landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The carvingwidth of hypercubes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:11, 29 June 2024

scientific article
Language Label Description Also known as
English
A New Property of Hamming Graphs and Mesh of d-ary Trees
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references