Bandwidth of the corona of two graphs (Q932628): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The bandwidth problem for graphs and matrices—a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3139862 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3803160 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity Results for Bandwidth Minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bandwidth of the Cartesian product of two connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness of the bandwidth minimization problem / rank | |||
Normal rank |
Latest revision as of 13:22, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bandwidth of the corona of two graphs |
scientific article |
Statements
Bandwidth of the corona of two graphs (English)
0 references
11 July 2008
0 references
bandwidth
0 references
corona
0 references
connectivity
0 references
diameter
0 references
distance
0 references
0 references