The neighbour-integrity of boolean graphs and its compounds (Q4944661): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207169908804867 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969859239 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A survey of integrity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692391 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Toughness of a Graph / rank | |||
Normal rank | |||
Latest revision as of 14:47, 29 May 2024
scientific article; zbMATH DE number 1420186
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The neighbour-integrity of boolean graphs and its compounds |
scientific article; zbMATH DE number 1420186 |
Statements
The neighbour-integrity of boolean graphs and its compounds (English)
0 references
21 March 2000
0 references
communication networks
0 references
vulnerability measure
0 references
Boolean graphs
0 references
