Results 81 to 90 of about 187,749 (326)

On almost hypohamiltonian graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj   +1 more source

Iwasawa theory for vertex-weighted graphs

29 pages, 8 ...
Murooka, Ryosuke, Tateno, Sohei
openaire   +2 more sources

Energy Band Alignment and Electro‐Optical Behavior of Nearly Unstrained Monolayer MoS2 Heterostructures With GaN

Advanced Materials Interfaces, EarlyView.
Large size (∼100 µm) monolayer MoS2 grown by LPI‐CVD on n‐GaN exhibit a high n‐type doping, very low strain, and a type‐I band alignment at MoS2/GaN interface. Photocurrent measurements under illumination with photon energies from ∼2 to ∼5 eV show superior electro‐optical performances of these MoS2/n‐GaN heterojunctions as compared to Ni/n‐GaN devices ...
Salvatore Ethan Panasci, Emanuela Schilirò, Giuseppe Greco, Patrick Fiorenza, Fabrizio Roccaforte, Fiorenza Esposito, Igor Píš, Federica Bondino, Antonino Madonia, Marco Cannas, Simonpietro Agnello, Luca Seravalli, Filippo Giannazzo   +12 more
wiley   +1 more source

Advancing Graph Theory with Genetic Algorithms: AFocus on Non-Inclusive Vertex Irregular Labeling

European Journal of Pure and Applied Mathematics
Non-inclusive irregular vertex labeling is a labeling on a graph where the vertex labels are real numbers with weights. The weight is defined as the sum of the labels of the connected nodes. The main problem in labeling graphs is finding the formula to apply the required labeling rules.
Kiswara Agung Santoso, Febyan Gilang Cristyanto, Ikhsanul Halikin, Ridho Alfarisi   +3 more
openaire   +1 more source

Vertex Cover Hop Dominating Sets in Graphs

European Journal of Pure and Applied Mathematics
Let $G$ be a graph. Then a subset $C$ of vertices of $G$ is called a vertex cover hop dominating if $C$ is both a vertex cover and a hop dominating of $G$.
Vergel T. Bilar, Maria Andrea O. Bonsocan, Javier A. Hassan, Susan C. Dagondon   +3 more
semanticscholar   +1 more source

A new bound for the 2/3 conjecture [PDF]

, 2012
We show that any n-vertex complete graph with edges coloured with three colours contains a set of at most four vertices such that the number of the neighbours of these vertices in one of the colours is at least 2n/3.
Sereni, Jean-Sébastien, Peter Whalen, Liu, Chun-Hung, Whalen, Peter, Chun-hung Liu, Yilma, Zelealem B., Jean-Sébastien Sereni, Zelealem B. Yilma, Yilma, Zelealem, Daniel Král, Král', Daniel   +10 more
core   +1 more source

Asymmetry in Skipping Enhances Viability Against Control Input Noise

Advanced Robotics Research, EarlyView.
Quadruped animals use asymmetric galloping gaits at high speeds, yet the functional role of this asymmetry remains unclear. This study shows that left–right asymmetry in touchdown angles enhances robustness to control noise. Using a simple two‐legged locomotion model and viability theory, it demonstrates that asymmetric skipping substantially enlarges ...
Yuichi Ambe, Alvin So, Shinya Aoi
wiley   +1 more source

The Degree Energy of a Graph

Mathematics
The incidence of edges on vertices is a cornerstone of graph theory, with profound implications for various graph properties and applications. Understanding degree distributions and their implications is crucial for analyzing and modeling real-world ...
A. R. Nagalakshmi, A. S. Shrikanth, G. K. Kalavathi, K. S. Sreekeshava   +3 more
doaj   +1 more source

A Toolkit for Targeted Neuromodulation of Striatal Direct Pathway Neurons Rescues Parkinsonian Motor Deficits in Mice

Advanced Science, EarlyView.
An adeno‐associated virus (AAV) toolkit enables selective anatomical and functional targeting of striatal D1‐MSNs through retrograde transduction. Enhanced capsids and engineered enhancers drive robust transgene expression across murine and primate models.
Zexuan Hong, Yujing Zhang, Junjiao Zhang, Hanhe Liu, Qiwei Liu, Yanglei Li, Lixin Yang, Lixia Li, Zhongjie Liu, Zhen Yuan, Zhonghua Lu, Yefei Chen, Yuantao Li, Yuwu Jiang, Taian Liu   +14 more
wiley   +1 more source

Directed graph iterated function systems [PDF]

, 2011
This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that ...
Boore, Graeme C.
core