Results 71 to 80 of about 174,518,636 (296)

Influence of the average vertex degree.

open access: yes, 2016
Connection between average vertex degree of a state graph and its total mixing time, respectively canonical path bound.
Steffen Rechner (2174908)   +1 more
core   +1 more source

Some Vertex/Edge-Degree-Based Topological Indices of r-Apex Trees

open access: yes, 2021
In chemical graph theory, graph invariants are usually referred to as topological indices. For a graph G, its vertex-degree-based topological indices of the form BIDG=∑uv∈EGβdu,dv are known as bond incident degree indices, where EG is the edge set of G ...
Liu, Jia-Bao   +7 more
core   +1 more source

Degree resistance distance of unicyclic graphs [PDF]

open access: yesTransactions on Combinatorics, 2012
Let G be a connected graph with vertex set V(G). The degree resistance distance of G is defined as the sum over all pairs of vertices of the terms [d(u)+d(v)] R(u,v), where d(u) is the degree of vertex u, and R(u,v) denotes the resistance distance ...
Ivan Gutman, Linhua Feng, Guihai Yu
doaj  

Reversible Calcium Alloying on Bulk and Indium (Sub)‐Micro Negative Electrodes for Calcium‐Based Batteries

open access: yesAdvanced Functional Materials, EarlyView.
Description: Indium metal serves as a reversible calcium‐alloying negative electrode. By transitioning from planar electrodes to powders and (sub‐)micron indium particles, the specific surface area is increased, improving the areal capacity density and cycling stability for calcium‐based batteries.
Wouter Monnens   +10 more
wiley   +1 more source

On Domination Topological Indices of Graphs

open access: yesInternational Journal of Analysis and Applications, 2020
Topological indices and domination in graphs are the essential topics in the theory of graphs. A set of vertices D ⊆ V (G) is said to be a dominating set for G if any vertex v ∈ V − D is adjacent to some vertex u ∈ D.
A.M. Hanan Ahmed   +2 more
doaj  

On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion

open access: yesJournal of Discrete Algorithms, 2015
16 pages, 4 figures, submitted to Elsevier's Journal of Discrete ...
Sounaka Mishra   +2 more
openaire   +3 more sources

Ligand Assisted Epitaxial Growth of CsPbBr3 Microcrystal Resonators With Record ‐Low Lasing Thresholds

open access: yesAdvanced Functional Materials, EarlyView.
Solution‐based ligand‐assisted epitaxial growth (LAEG) yields high‐quality CsPbBr3 microcrystals on different substrates with superior morphology, passivated surfaces, and high photoluminescence quantum yield. These robust micro‐resonators achieve record‐low room‐temperature lasing thresholds of 7.2 kW·cm−2 and maintain operational stability up to 90 ...
Shuyu Zhou   +19 more
wiley   +1 more source

On Bounded-Degree Vertex Deletion parameterized by treewidth

open access: yesDiscrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nadja Betzler   +3 more
openaire   +2 more sources

The Effect of Hydrophilic Headgroup Chemistry on Peptoid‐Directed Mineralization of CaCO3

open access: yesAdvanced Functional Materials, EarlyView.
Amphiphilic peptoids alter the pathway and outcome of calcium carbonate crystallization, which progresses through amorphous calcium carbonate (ACC) to vaterite to calcite rhombs in the absence of peptoids. In contrast, amine‐terminated peptoids produce vaterite disks and carboxyl‐terminated peptoids produce calcite mesocrystals.
Biao Jin   +5 more
wiley   +1 more source

A straightforward edge centrality concept derived from generalizing degree and strength

open access: yesScientific Reports, 2022
Vertex degree—the number of edges that are incident to a vertex—is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network’s structure and ...
Timo Bröhl, Klaus Lehnertz
doaj   +1 more source

Home - About - Disclaimer - Privacy