Results 71 to 80 of about 2,145,411 (284)
On Computation of Edge Degree-Based Banhatti Indices of a Certain Molecular Network
Journal of Mathematics, 2021 Chemical graph theory deals with the basic properties of a molecular graph. In graph theory, we correlate molecular descriptors to the properties of molecular structures.
Jiang-Hua Tang +6 more
doaj +1 more source
Edge-face coloring of plane graphs with maximum degree nine [PDF]
Journal of Graph Theory, 2010 Summary: An edge-face coloring of a plane graph with edge set \(E\) and face set \(F\) is a coloring of the elements of \(E \cup F\) so that adjacent or incident elements receive different colors. Borodin [Discrete Math. 128, No.1--3, 21--33 (1994; Zbl 0807.05029)] proved that every plane graph of maximum degree \(\Delta \geq 10\) can be edge-face ...
Sereni, Jean-Sébastien, Stehlík, Matej
openaire +3 more sources
Revealing the structure of land plant photosystem II: the journey from negative‐stain EM to cryo‐EM
FEBS Letters, EarlyView.Advances in cryo‐EM have revealed the detailed structure of Photosystem II, a key protein complex driving photosynthesis. This review traces the journey from early low‐resolution images to high‐resolution models, highlighting how these discoveries deepen our understanding of light harvesting and energy conversion in plants.
Roman Kouřil
wiley +1 more source
IEEE Access, 2021 With the continuous development of 5G network technology, the amount of data has surged. Network data transmission technology needs improvement. To ensure the reliable transmission of data, reduce network congestion and network energy consumption, the ...
Xiaomin Wu +3 more
doaj +1 more source
Parameterized complexity of three edge contraction problems with degree constraints [PDF]
Acta Informatica, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belmonte, R. +3 more
openaire +5 more sources
Outerplanar graph drawings with few slopes
, 2014 We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Bartosz Walczak +16 more
core +2 more sources
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph with minimum degree $\delta$ and edge-connectivity $\lambda$. A graph is maximally edge-connected if $\lambda=\delta$, and it is super-edge-connected if every minimum edge-cut is trivial; that is, if every ...
Lutz Volkmann, Zhen-Mu Hong
doaj +1 more source
On Conditional Connectivity of the Cartesian Product of Cycles
Discussiones Mathematicae Graph Theory, 2023 The conditional h-vertex (h-edge) connectivity of a connected graph H of minimum degree k > h is the size of a smallest vertex (edge) set F of H such that H − F is a disconnected graph of minimum degree at least h. Let G be the Cartesian product of r ≥ 1
Saraf J.B., Borse Y.M., Mundhe Ganesh
doaj +1 more source
Vertices of degree k in edge-minimal, k-edge-connected graphs
, 2009 Halin showed that every edge minimal, k-vertex connected graph has a vertex of degree k. In this note, we prove the analogue to Halin's theorem for edge-minimal, k-edge-connected graphs. We show there are two vertices of degree k in every edge-minimal, k-edge-connected graph.
Kingsford, Carl, Marçais, Guillaume
openaire +2 more sources