Minimum size of a graph or digraph of given radius (Q989544): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5461702 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5442174 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of edges in a bipartite graph of given radius / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2761046 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Radius, diameter, and minimum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum induced trees in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3781134 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5516082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for the radius of a 3-connected graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the radius of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5616731 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3620555 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5541882 / rank | |||
Normal rank |
Latest revision as of 03:21, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum size of a graph or digraph of given radius |
scientific article |
Statements
Minimum size of a graph or digraph of given radius (English)
0 references
20 August 2010
0 references
interconnection networks
0 references
graph
0 references
digraph
0 references
radius
0 references
minimum degree
0 references
size
0 references