Results 101 to 110 of about 39,296 (257)
Extremal Graphs for Intersecting Triangles
A \(k\)-fan is a graph with \(2k+ 1\) vertices consisting of \(k\) 3-cycles having one vertex in common. The authors show that if \(n\geq 50k^2\) and the graph \(G_n\) has more than \([n^2/4]+ k^2- ck\) edges, where \(c\) equals 1 or 3/2 according as \(k\) is odd or even, then \(G_n\) contains a \(k\)-fan; furthermore, the bound for the number of edges
Erdos, P. +3 more
openaire +2 more sources
Thermal Processing Creates Water‐Stable PEDOT:PSS Films for Bioelectronics
Instead of using chemical cross–linkers, it is shown that PEDOT:PSS thin films for bioelectronics become water‐stable after a simple heat treatment. The heat treatment is compatible with a range of rigid and elastomeric substrates and films are stable in vivo for >20 days.
Siddharth Doshi +16 more
wiley +1 more source
On the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined as the sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where $d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math.
R. Rasi
doaj +1 more source
AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
High‐Performance Zero‐Gap Glycerol‐Fed Electrolyzer for C3 Chemicals and Hydrogen Production
This work presents a dynamic, self‐regulating operation strategy that enables selective glycerol electrooxidation in the OER‐free regime, co‐producing C3 chemicals and hydrogen at cell voltages below 1.25 V. Voltage‐ and temperature‐resolved analyses define optimal operating conditions, achieving a sustained current density of 500 mA cm−2 at ∼1.21 V ...
Shayan Angizi +11 more
wiley +1 more source
Two Short Proofs on Total Domination
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex in the set. The total domination number of a graph Υt (G) is the minimum size of a total dominating set.
Bickle Allan
doaj +1 more source
Extreme Outer Connected Geodesic Graphs
For a connected graph G of order at least two, a set S of vertices in a graph G is said to be an outer connected geodetic set if S is a geodetic set of G and either S = V or the subgraph induced by V − S is connected. The minimum cardinality of an outer connected geodetic set of G is the outer connected geodetic number of G and is denoted by goc(G ...
Ganesamoorthy, K., Jayanthi, D.
openaire +1 more source
Schematic illustration of the electrically assisted thermal stamping (EATS) method for direct fabrication of carbon‐based nanofilms and their multifunctional applications. Localized Joule heating triggers simultaneous exfoliation, reduction, and fluoropolymer incorporation under ambient conditions, yielding tunable carbon‐based thin‐film coatings ...
Byungseok Seo +9 more
wiley +1 more source
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex.
Wang Dingguo, Shan Erfang
doaj +1 more source
Extremal Restraints for Graph Colourings
7 pages, 1 ...
Brown, Jason I., Erey, Aysel, Li, Jian
openaire +3 more sources

