Results 101 to 110 of about 187,749 (326)
Spectral characterizations of sun graphs and broken sun graphs [PDF]
Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question ''Which graphs are determined by their spectrum?''
Romain Boulet
doaj +1 more source
Designer Dynamic DNA Nanoaggregate in Living Cell for Mitochondrial Energy Restriction
This study presents the Tech‐tetrahedron, a designer dynamic DNA nanoaggregate engineered for precise mitochondrial energy restriction. Its trinity‐functionalized design integrates navigable unit, telomerase‐activated latch, and self‐assembly module.
Ruijia Deng +12 more
wiley +1 more source
Among various graph products, the corona product continues to inspire novel research. Subdivision graphs play a key role in understanding graph behaviour under edge modifications.
Vimal M. +3 more
doaj +1 more source
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
On the number of pentagons in triangle-free graphs [PDF]
Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)(5) cycles of length five. Moreover, the equality is attained only when n is divisible by five and G is the balanced blow-up of the ...
Hatami, Hamed +4 more
core +1 more source
Interacting Parallel Fluidic Hysterons
The parallel coupling of fluidic hysterons is introduced, establishing advanced functionalities in inflatable soft systems. A pressure–volume framework reveals how preset volumes Δv∗${\Delta }v^*$ tune nonlinear interactions between hysterons and actuation sequences without changing architecture. Experiments validate the predictions, opening new routes
Katrien Stinissen +2 more
wiley +1 more source
The locating chromatic number of (k,n)-split cycle graph and its barbell operation
The locating chromatic number remains an active topic in graph theory. It combines the concepts of partition dimension and proper vertex coloring. A necessary condition for determining the locating chromatic number is that each vertex must have a unique ...
Asmiati Asmiati +3 more
doaj +1 more source
A New Type-2 Soft Set: Type-2 Soft Graphs and Their Applications
The correspondence between a vertex and its neighbors has an essential role in the structure of a graph. Type-2 soft sets are also based on the correspondence of primary parameters and underlying parameters.
Khizar Hayat +3 more
doaj +1 more source
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks.
Xiujun Zhang +3 more
doaj +1 more source
-labeling of supersubdivided connected graph plus an edge
Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source

