Results 151 to 160 of about 27,053 (309)
Some complexity results on semipaired domination in graphs
Let [Formula: see text] be a graph without any isolated vertices. A semipaired dominating set [Formula: see text] of G, is a dominating set of G, if D can be partitioned into cardinality 2 subsets such that the vertices in each of these subsets are at ...
Vikash Tripathi, Kusum, Arti Pandey
doaj +1 more source
The water permeability of amorphous carbon dots (CDs) is demonstrated by investigating their plasticization. Novel polyamide‐based and amorphous nanoparticles are synthesized by controlling their inner packing density. Water plasticization is evidenced by the decrease of the CDs glass transition temperature with increasing the hydration degree.
Elisa Sturabotti +8 more
wiley +1 more source
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
Hierarchical specifications of graphs have been widely used in many important applications, such as VLSI design, parallel programming and software engineering. A well known hierarchical specification model, considered in this work, is that of Lengauer [9,
Andreou, M. +9 more
core
Edge DP-Coloring in K4-Minor Free Graphs and Planar Graphs
The edge DP-chromatic number of G, denoted by χDP′(G), is the minimum k such that G is edge DP-k-colorable. In 1999, Juvan, Mohar, and Thomas proved that the edge list chromatic number of K4-minor free graph G with Δ≥3 is Δ.
Jingxiang He, Ming Han
doaj +1 more source
Hyperbolicity vs. Amenability for Planar Graphs. [PDF]
Federici B, Georgakopoulos A.
europepmc +1 more source
POM‐Based Water Splitting Catalyst Under Acid Conditions Driven by Its Assembly on Carbon Nanotubes
A newly‐engineered POM‐based electrocatalyst incorporating non‐innocent counter cations exhibits fast kinetics for either the OER or HER under strongly acidic conditions (1 m H2SO4), depending on whether it is assembled on carbon nanotubes (1@CNT) or physically mixed with them (1/CNT). In water‐splitting tests using a two‐electrode setup, these systems
Eugenia P. Quirós‐Díez +8 more
wiley +1 more source
Fast parallel algorithms for vertex and edge colouring of Halin graphs [PDF]
We show that every Halin graph can be optimally edge-coloured or optimally vertex-coloured in polylog time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.) +1 more
core
From the betweenness centrality in street networks to structural invariants in random planar graphs. [PDF]
Kirkley A +3 more
europepmc +1 more source
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +1 more source

