Results 261 to 270 of about 34,321,194 (310)
Some of the next articles are maybe not open access.
, 2020
In this article, proton, neutron, and gamma-ray shielding competences of six glasses with PbO or PbO/Bi2O3 heavy metal oxides namely as Glass 1 to Glass 6 have been investigated via WinXcom and EXABCal computer codes. The maximum values of μ m were equal
Y. Rammah +4 more
semanticscholar +1 more source
In this article, proton, neutron, and gamma-ray shielding competences of six glasses with PbO or PbO/Bi2O3 heavy metal oxides namely as Glass 1 to Glass 6 have been investigated via WinXcom and EXABCal computer codes. The maximum values of μ m were equal
Y. Rammah +4 more
semanticscholar +1 more source
On (g, f)-factorizations of graphs
Applied Mathematics and Mechanics, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Runnian, Gao, Hangshan
openaire +2 more sources
Cartilage: The ‘F’-factor fallacy
Clinical Oncology, 1993It remains common practice to treat skin lesions overlying cartilage with electrons, apparently because of an assumption that radiation absorption qualities of non-calcified cartilage are similar to those of bone. We present data based on tissue composition and calculated mass absorption coefficients, supporting the view that such lesions may safely be
P, Atherton, J, Townley, J, Glaholm
openaire +2 more sources
Journal of Graph Theory, 2001
AbstractIn this paper we study connected (g, f)‐factors. We describe an algorithm to connect together an arbitrary spanning subgraph of a graph, without increasing the vertex degrees too much; if the algorithm fails we obtain information regarding the structure of the graph. As a consequence we give sufficient conditions for a graph to have a connected
Mark N. Ellingham +2 more
openaire +1 more source
AbstractIn this paper we study connected (g, f)‐factors. We describe an algorithm to connect together an arbitrary spanning subgraph of a graph, without increasing the vertex degrees too much; if the algorithm fails we obtain information regarding the structure of the graph. As a consequence we give sufficient conditions for a graph to have a connected
Mark N. Ellingham +2 more
openaire +1 more source
Health Physics, 1983
Consideration of the equilibrium factor F between the concentration of the radon daughters and the concentration of radon is a part of the evaluation of the measurements of radon daughter concentrations in dwellings when applying limits. Measurements of radon, radon daughters and air exchange rates have been carried out in 225 dwellings in Sweden.
openaire +2 more sources
Consideration of the equilibrium factor F between the concentration of the radon daughters and the concentration of radon is a part of the evaluation of the measurements of radon daughter concentrations in dwellings when applying limits. Measurements of radon, radon daughters and air exchange rates have been carried out in 225 dwellings in Sweden.
openaire +2 more sources
Orthogonal (g, f)-factorizations in networks
Networks, 2000Summary: Let \(G= (V,E)\) be a graph and let \(g\) and \(f\) be two integer-valued functions defined on \(V\) such that \(k\leq g(x)\leq f(x)\) for all \(x\in V\). Let \(H_1,H_2,\dots, H_k\) be subgraphs of \(G\) such that \(|E(H_i)|= m\), \(1\leq i\leq k\), and \(V(H_i)\cap V(H_j)= \emptyset\) when \(i\neq j\). In this paper, it is proved that every \(
Peter Che Bor Lam +3 more
openaire +2 more sources
2011
In this chapter we consider regular factors and f-factors mainly in general graphs. For a positive integer k, a regular spanning subgraph, each of whose vertices has constant degree k, is called a k-regular factor or simply a k- factor (Fig. 3.1). In order to avoid confusion, we use “k-regular factors” in theorems, but often use “k-factors” in proofs ...
Jin Akiyama, Mikio Kano
openaire +1 more source
In this chapter we consider regular factors and f-factors mainly in general graphs. For a positive integer k, a regular spanning subgraph, each of whose vertices has constant degree k, is called a k-regular factor or simply a k- factor (Fig. 3.1). In order to avoid confusion, we use “k-regular factors” in theorems, but often use “k-factors” in proofs ...
Jin Akiyama, Mikio Kano
openaire +1 more source
Decomposition of Graphs into (g, f)-Factors
Graphs and Combinatorics, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guiying Yan +3 more
openaire +2 more sources
Journal of the Franklin Institute, 1985
This paper probes the relations between f-factors and subgraphs and their degree sequences in a graph when the graph has the odd-cycle property and contains no self-loop. Useful results are derived which greatly simplify tests of the existence of f-factors.
Lan, Jialong, Chen, Wai-Kai
openaire +1 more source
This paper probes the relations between f-factors and subgraphs and their degree sequences in a graph when the graph has the odd-cycle property and contains no self-loop. Useful results are derived which greatly simplify tests of the existence of f-factors.
Lan, Jialong, Chen, Wai-Kai
openaire +1 more source
ON ORTHOGONAL (0, f )-FACTORIZATIONS
Acta Mathematica Scientia, 1999Let \(G\) be a graph with vertex set \(V(G)\) and edge set \(E(G)\), and let \(g\) and \(f\) be two nonnegative integer-valued functions defined on \(V(G)\) such that \(g(x)\leq f(x)\) for every vertex \(x\) of \(G\). By \(d_G(x)\) we denote the degree of a vertex \(x\) of \(G\). A graph \(G\) is called a \((g,f)\)-graph if \(g(x)\leq d_G(x)\leq f(x)\)
openaire +2 more sources