No label defined (Q3789598)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4053657 |
Statements
1985
0 references
0.9012578
0 references
0.8933624
0 references
0.88702196
0 references
0.8829173
0 references
0.8800439
0 references
Let G be a critically 2-line-connected graph and D be the set of vertices with degree two in the graph G. \(\Delta(G)\) denotes the maximum degree of G and \(D_{\geq 2k-1}(G)=\{x:(x\in G)\wedge (d(x)\geq 2k-1)\},\) \(D_{2k- 1;2k}(G)=\{x:(x\in G)\wedge (2k-1\leq d(x)\leq 2k)\},\) where k is a natural number. The symbol [a] denotes the greatest integer not greater than a. We prove the following theorems: Theorem 1. Let \(| D| =\alpha\) then \(\Delta (G)\leq 2[\alpha /2];\) Theorem 2. Let \(| D| =\alpha\) and \(\alpha \geq 2k\geq 6,\) then \[ | D_{\geq 2k-1}(G)| \leq 2k[\frac{\alpha -4}{2k-4}]+2[\frac{\alpha -4-(2k-4)[(\alpha -4)/(2k- 4)]}{2}]; \] Theorem 3. Let \(| D| =\alpha\) and \(\alpha\geq 2k\geq 6\), then \[ | D_{2k-1| 2k}(G)| \leq 2k[\frac{a-4}{2k- 4}]+2[\frac{\alpha -4-(2k-4)[(\alpha -4)/(2k-4)]}{2}]. \] And in the above three theorems the upper bounds are the best possible.
0 references