scholarly journals A note on the interval function of a disconnected graph

2018 ◽  
Vol 38 (1) ◽  
pp. 39 ◽  
Author(s):  
Manoj Changat ◽  
Ferdoss Hossein Nezhad ◽  
Henry Martyn Mulder ◽  
Narayanan Narayanan
Keyword(s):  
Interval Function ◽  
Disconnected Graph

scholarly journals Axiomatic characterization of the interval function of a graph

2009 ◽  
Vol 30 (5) ◽  
pp. 1172-1185 ◽  
Author(s):  
Henry Martyn Mulder ◽  
Ladislav Nebeský
Keyword(s):  
Axiomatic Characterization ◽  
Interval Function

scholarly journals Super Connectivity of Erdős-Rényi Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 267 ◽  
Author(s):  
Yilun Shang
Keyword(s):  
Random Graphs ◽  
Minimum Cardinality ◽  
Super Connectivity ◽  
Isolated Vertex ◽  
Disconnected Graph

The super connectivity κ ′ ( G ) of a graph G is the minimum cardinality of vertices, if any, whose deletion results in a disconnected graph that contains no isolated vertex. G is said to be r-super connected if κ ′ ( G ) ≥ r . In this note, we establish some asymptotic almost sure results on r-super connectedness for classical Erdős–Rényi random graphs as the number of nodes tends to infinity. The known results for r-connectedness are extended to r-super connectedness by pairing off vertices and estimating the probability of disconnecting the graph that one gets by identifying the two vertices of each pair.

scholarly journals INTERVAL EXTENSION STRUCTURE BASIC TYPES OF SOLUTIONS OF BOUNDARY VALUE PROBLEMS FOR LINEAR PARTIAL DIFFERENTIAL EQUATIONS OF THE SECOND ORDER

2018 ◽  
pp. 10-14
Keyword(s):  
Dirichlet Problem ◽  
Partial Differential Equations ◽  
Differential Operator ◽  
Boundary Conditions ◽  
Mixed Boundary ◽  
Mixed Boundary Conditions ◽  
Interval Function ◽  
The Third ◽  
Interval Extension ◽  
The Neumann Problem

. In this article, the interval expansion of the structure of solving basic types of boundary value problems for partial differential equations of the second order of making the basic operations that compose interval arithmetic is developed. For the differential equation (1) of the type, when constructing the interval expansion of the structure of the formula, structural formulas were used to construct with the Rfunction method and 4 problems were studied — the Dirichlet problem, the Neumann problem, the third type problem, the mixed boundary conditions problem. For the Dirichlet problem, the solution is an interval expansion of the structure in the form (5), where 𝑃 = {𝜔𝛷 , 𝜔𝛷̅, 𝜔̅𝛷, 𝜔̅𝛷̅} и [ 𝛷, 𝛷̅]is an indefinite interval function. For the Neumann problem, a solution is solved in the interval extension of the structure, [ 𝛷1, 𝛷1̅̅̅̅], [ 𝛷2, 𝛷2̅̅̅̅] is an indefinite interval function and 𝐷1 is a differential operator of the form. For the problem of the third type, the solution is solved in the interval extension of the structure, [ 𝛷1, 𝛷1̅̅̅̅], [𝛷2, 𝛷2̅̅̅̅] -indefinite, interval function, 𝐷1 - differential operator of the form (9). For the problem, mixed boundary conditions are treated. The solution In the interval extension of the structure,[ 𝛷1, 𝛷1], [ 𝛷2, 𝛷2̅̅̅̅] is an indefinite interval function and 𝐷1 is a differential operator of the form.

On Computing Component (Edge) Connectivities of Balanced Hypercubes

2019 ◽  
Vol 63 (9) ◽  
pp. 1311-1320 ◽  
Author(s):  
Mei-Mei Gu ◽  
Jou-Ming Chang ◽  
Rong-Xia Hao
Keyword(s):  
Upper Bound ◽  
Edge Connectivity ◽  
Combinatorial Properties ◽  
Minimum Number ◽  
Two Parameters ◽  
Disconnected Graph

Abstract For an integer $\ell \geqslant 2$, the $\ell $-component connectivity (resp. $\ell $-component edge connectivity) of a graph $G$, denoted by $\kappa _{\ell }(G)$ (resp. $\lambda _{\ell }(G)$), is the minimum number of vertices (resp. edges) whose removal from $G$ results in a disconnected graph with at least $\ell $ components. The two parameters naturally generalize the classical connectivity and edge connectivity of graphs defined in term of the minimum vertex-cut and the minimum edge-cut, respectively. The two kinds of connectivities can help us to measure the robustness of the graph corresponding to a network. In this paper, by exploring algebraic and combinatorial properties of $n$-dimensional balanced hypercubes $BH_n$, we obtain the $\ell $-component (edge) connectivity $\kappa _{\ell }(BH_n)$ ($\lambda _{\ell }(BH_n)$). For $\ell $-component connectivity, we prove that $\kappa _2(BH_n)=\kappa _3(BH_n)=2n$ for $n\geq 2$, $\kappa _4(BH_n)=\kappa _5(BH_n)=4n-2$ for $n\geq 4$, $\kappa _6(BH_n)=\kappa _7(BH_n)=6n-6$ for $n\geq 5$. For $\ell $-component edge connectivity, we prove that $\lambda _3(BH_n)=4n-1$, $\lambda _4(BH_n)=6n-2$ for $n\geq 2$ and $\lambda _5(BH_n)=8n-4$ for $n\geq 3$. Moreover, we also prove $\lambda _\ell (BH_n)\leq 2n(\ell -1)-2\ell +6$ for $4\leq \ell \leq 2n+3$ and the upper bound of $\lambda _\ell (BH_n)$ we obtained is tight for $\ell =4,5$.

On the Existence of the Burkill Integral

1958 ◽  
Vol 10 ◽  
pp. 115-121 ◽  
Author(s):  
H. Kober
Keyword(s):  
Interval Function

The main problem of the present paper is the existence of the Burkill integral of an interval function ƒ(I) which is not supposed to be continuous. Little is known about this case, though otherwise the theory of the integral can be considered as complete: we may refer to Ringenberg's comprehensive paper (2) in which further references are given.

Sign in / Sign up

Export Citation Format

Share Document