Results 61 to 70 of about 357,448 (292)
Search for the end of a path in the d-dimensional grid and in other graphs [PDF]
, 2015 We consider the worst-case query complexity of some variants of certain \cl{PPAD}-complete search problems. Suppose we are given a graph $G$ and a vertex $s \in V(G)$.
Gerbner, Dániel +4 more
core +2 more sources
Computing Eccentricity Based Topological Indices of Octagonal Grid O n m
Mathematics, 2018 Graph theory is successfully applied in developing a relationship between chemical structure and biological activity. The relationship of two graph invariants, the eccentric connectivity index and the eccentric Zagreb index are investigated with regard ...
Xiujun Zhang +3 more
doaj +1 more source
Graphs with Large Disjunctive Total Domination Number
, 2014 Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\gamma_t(G)$.
Henning, Michael A., Naicker, Viroshan
core +2 more sources
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths [PDF]
, 2018 When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings?
Abel, Zachary +5 more
core +2 more sources
Advanced Biology, EarlyView.The axolotl's remarkable regenerative abilities decline with age, the causes may include the numerous repetitive elements within its genome. This study uncovers how Ty3 retrotransposons and coexpression networks involving muscle and immune pathways respond to aging and regeneration, suggesting that transposons respond to physiological shifts and may ...
Samuel Ruiz‐Pérez +8 more
wiley +1 more source
The adjacency matrix of one type of graph and the Fibonacci numbers [PDF]
, 2012 Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence.
Bozkurt, Durmuş +2 more
core
Breaking quadratic time for small vertex connectivity and an approximation scheme [PDF]
Symposium on the Theory of Computing, 2019 Vertex connectivity a classic extensively-studied problem. Given an integer k, its goal is to decide if an n-node m-edge graph can be disconnected by removing k vertices.
Danupon Nanongkai +2 more
semanticscholar +1 more source
Scaling‐Up of Structural Superlubricity: Challenges and Opportunities
Advanced Functional Materials, EarlyView.At increasing length‐scales, structural superlubricity (SSL) faces challenges from physical and chemical energy dissipation pathways. This study reviews recent experimental and theoretical progress on these challenges facing the scaling‐up of SSL, as well as perspectives on future directions for realizing and manipulating macroscale superlubricity ...
Penghua Ying +4 more
wiley +1 more source
A SURVEY M-POLAR FUZZY GRAPHS [PDF]
Fiabilitate şi Durabilitate, 2019 I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj
Advanced Functional Materials, EarlyView.HKUST‐1/TiO2 composite materials show a very high photocatalytic hydrogen evolution rate which increases as a function of the irradiation time until reaching a plateau and even surpasses the performance of the 1%Pt/TiO2 material after three photocatalytic cycles.
Alisha Khan +9 more
wiley +1 more source