Regular separable graphs of minimum order with given diameter (Q1148920): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem of the theory of communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4129477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extremal Problem of Graphs with Diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs of diameter 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Design for (d, k) Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Simple Paths in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters of Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and enumeration of minimum (d, 3, 3)-graphs for odd d / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum graphs of specified diameter, connectivity and valence. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3289363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence of Finite-State Sequential Machine Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5571711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5518979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Critical Graphs of Diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some extremal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Klee and Quaife minimum (d, 1, 3)-graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum-order three-connected cubic graphs with specified diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (d, k, μ) Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Construction Techniques for (d, k) Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3245554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5345644 / rank
 
Normal rank

Latest revision as of 10:25, 13 June 2024

scientific article
Language Label Description Also known as
English
Regular separable graphs of minimum order with given diameter
scientific article

    Statements

    Regular separable graphs of minimum order with given diameter (English)
    0 references
    0 references
    1981
    0 references
    regular separable graphs
    0 references
    diameter
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers