Results 281 to 290 of about 372,249 (313)
Some of the next articles are maybe not open access.
2013
In this chapter the authors consider a property of a whole graph, which is of theoretical and practical importance. The concept addresses the possibility of drawing a given graph in a plane such that none of its edges intersect. The authors find this property, named planarity, very useful in application.
Hossein Hojabri, Elnaz Miandoabchi
openaire +1 more source
In this chapter the authors consider a property of a whole graph, which is of theoretical and practical importance. The concept addresses the possibility of drawing a given graph in a plane such that none of its edges intersect. The authors find this property, named planarity, very useful in application.
Hossein Hojabri, Elnaz Miandoabchi
openaire +1 more source
The Journal of Physical Chemistry B, 2006
The system of two parallel planar, arbitrarily charged surfaces immersed in a solution containing only one ionic species, the counterions, is completely analyzed under a mean field Poisson-Boltzmann approach. Results for the pressure, reduced potential, and counterionic concentration are graphically displayed for two dissociating membranes and for a ...
Agostinho-Neto, A., Drigo Filho, Elso
openaire +3 more sources
The system of two parallel planar, arbitrarily charged surfaces immersed in a solution containing only one ionic species, the counterions, is completely analyzed under a mean field Poisson-Boltzmann approach. Results for the pressure, reduced potential, and counterionic concentration are graphically displayed for two dissociating membranes and for a ...
Agostinho-Neto, A., Drigo Filho, Elso
openaire +3 more sources
Combinatorics, Probability and Computing, 1995
This paper presents a constructive proof that for any planar digraph G on p vertices, there exists a subset S of the transitive closure of G such that the number of arcs in S is less than or equal to the number of arcs in G, and such that the diameter of G∪S is O(α(p, p)(log p)2).
openaire +1 more source
This paper presents a constructive proof that for any planar digraph G on p vertices, there exists a subset S of the transitive closure of G such that the number of arcs in S is less than or equal to the number of arcs in G, and such that the diameter of G∪S is O(α(p, p)(log p)2).
openaire +1 more source
Planar Spiral Inductors, Planar Antennas and Embedded Planar Transformers
2023openaire +1 more source