Graphs with minimal strength
For any graph G of order p, a bijection f: V(G) → {1, 2,…, p} is called a numbering of G. The strength str f (G) of a numbering f of G is defined by str f (G) = max{ f (u) + f (v) | uv ε E(G)}, and the strength str(G) of a graph G is str(G) = min{str f (G) | f is a numbering of G}. In this paper, ma...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021
|
| Series: | Symmetry
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher View in Scopus |