scientific article; zbMATH DE number 4053657

From MaRDI portal
Publication:3789598





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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789598)