On the neighbour-integrity of sequential joined graphs (Q4951742): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A survey of integrity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the honesty of graph complements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-integrity: A survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871072 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Toughness of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692391 / rank | |||
Normal rank |
Latest revision as of 15:51, 29 May 2024
scientific article; zbMATH DE number 1442150
Language | Label | Description | Also known as |
---|---|---|---|
English | On the neighbour-integrity of sequential joined graphs |
scientific article; zbMATH DE number 1442150 |
Statements
On the neighbour-integrity of sequential joined graphs (English)
0 references
22 November 2000
0 references
vertex-neighbor-integrity
0 references
0 references