Profile minimization problem for matrices and graphs (Q1327828)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Profile minimization problem for matrices and graphs |
scientific article; zbMATH DE number 597376
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Profile minimization problem for matrices and graphs |
scientific article; zbMATH DE number 597376 |
Statements
Profile minimization problem for matrices and graphs (English)
0 references
29 June 1994
0 references
This paper deals with the profile width of a vertex of a simple graph \(G\) and the profile of a numbering \(f\) of \(G\), where the numbering \(f\) of \(G\) is defined as a bijection \(f:V(G) \to \{1,2, \dots, | V(G) |\}\). The authors give the profile of several graphs without proof and succeed in determining a formula for the profile of trees of diameter 4.
0 references
minimization problem
0 references
matrices
0 references
numbering of graphs
0 references
profile
0 references
simple graph
0 references
trees
0 references
0 references
