Results 61 to 70 of about 1,930 (230)

Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\lceil\frac{|V(G)|}{k}\rceil$ vertices.
Aijun Dong, Jianliang Wu
doaj   +1 more source

Chordally signed graphs

Discrete Applied Mathematics, 2002
AbstractDefine a chordally signed graph to be a signed chordal graph (meaning that each edge is designated as being positive or negative and every induced cycle is a triangle) in which every positive cycle C (meaning every cycle C that contains an even number of negative edges) has a chord e such that C∪{e} forms two positive cycles.
openaire   +2 more sources

Wireless In Situ Catalytic Electron Signaling‐Mediated Transcriptomic Reprogramming for Neuron Regeneration via Adaptable Antennas

Advanced Science, EarlyView.
A wireless‐charging sustained oxygen release from conductive microgels (SOCO) served as an antenna and an on‐demand O2 release for nerve regeneration is developed. Introducing “electromagnetic messenger”, using external alternating magnetic field (AMF) to enhance catalytic oxygen release and electrical stimulation to promote the reconstruction of blood
Hoi Man Iao, Chih‐Ying Chen, Ya‐Hui Lin, Wan‐Chi Pan, Chun‐Yi Liang, Hsiu‐Ching Liu, Lo‐Jei Ching, Pei‐Yu Weng, Min‐Ren Chiang, Ru‐Siou Hsu, Tsu‐Chin Chou, I‐Chi Lee, Lun‐De Liao, Li‐An Chu, Shih‐Hwa Chiou, Shang‐Hsiu Hu   +15 more
wiley   +1 more source

Mineralized area of the human rib cross‐sections from early puberty until adulthood

The Anatomical Record, EarlyView.
Abstract Ribs undergo numerous changes during growth and development. Although they occur both externally and internally, the latter are not as extensively documented during the transition from puberty to adulthood. Therefore, it is unknown how rib cross‐sectional mineralized area changes during this period.
J. M. López‐Rey, D. M. Doe, O. Cambra‐Moo, A. González Martín, D. García‐Martínez   +4 more
wiley   +1 more source

On b-perfect Chordal Graphs [PDF]

Graphs and Combinatorics, 2009
The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.
Maffray, Frédéric, Mechebbek, Meriem
openaire   +5 more sources

Systematic Investigation of the Residence Time Distribution in a Twin‐Screw Extruder for the Continuous Mixing Process of Electrode Slurry in the Battery Cell Production

Energy Technology, EarlyView.
The residence time distribution in the continuous mixing process for battery raw material is systematically investigated. Suitable tracers are identified, with NaCl for the twin‐screw extruder and sodium bicarbonate for powder dosing. Key parameters are varied, showing that mass flow has the strongest influence, while solid content also plays a ...
Simon Otte, Julia Maelger, Sebastian Schabel, Hermann Nirschl, Jürgen Fleischer   +4 more
wiley   +1 more source

A new method for computing the vertex PI index with applications to special classes of graphs

AKCE International Journal of Graphs and Combinatorics
The Padmakar-Ivan (PI) index of a graph G is given by [Formula: see text], where [Formula: see text] is the number of equidistant vertices for the edge e.
S. C. Manju, K. Somasundaram, Yilun Shang   +2 more
doaj   +1 more source

Design Optimization and Performance Investigation of a Micro Wind Turbine for Domestic Dwelling Used for Renewable Generation System

Energy Science &Engineering, EarlyView.
ABSTRACT This study focuses on wind turbine blade optimization using a MATLAB‐based algorithm, QBlade, and CFD software to improve the performance of micro‐horizontal axis wind turbines (HAWTs) in low wind speed environments, particularly for residential use.
Wissam K. Abbas, Majid Abbasalizadeh, Shahram Khalilarya   +2 more
wiley   +1 more source

Simultaneously dominating all spanning trees of a graph

Electronic Journal of Graph Theory and Applications, 2022
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann, Sven O. Krumke, Manuel Streicher   +2 more
doaj   +1 more source

Dominating cliques in chordal graphs

Discrete Mathematics, 1994
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set—and, furthermore, there is a linear-time algorithm to find such a small dominating clique.
Anna Lubiw, Dieter Kratsch, Peter Damaschke   +2 more
openaire   +2 more sources