Results 41 to 50 of about 293,400 (267)
On the Locating Chromatic Number of Certain Barbell Graphs
International Journal of Mathematics and Mathematical Sciences, 2018 The locating chromatic number of a graph G is defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are not ...
Asmiati +2 more
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objectives Repetitive transcranial magnetic stimulation (rTMS) is a non‐invasive brain stimulation strategy with a demonstrated potential to reinforce the residual pathways after a spinal cord injury (SCI). A preclinically tested high‐frequency (15 Hz) rTMS (15 Hz rTMS) protocol was shown to induce corticospinal tract axon regeneration growth ...
Nabila Brihmat +8 more
wiley +1 more source
The Application of Fault-Tolerant Partition Resolvability in Cycle-Related Graphs
Applied Sciences, 2022 The concept of metric-related parameters permeates all of graph theory and plays an important role in diverse networks, such as social networks, computer networks, biological networks and neural networks.
Kamran Azhar +4 more
doaj +1 more source
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
International Journal of Adaptive Control and Signal Processing, EarlyView.This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley +1 more source
Partition Resolvability of Nanosheet and Nanotube Derived from Octagonal Grid
Journal of MathematicsChemical graph theory, a branch of computational and applied mathematics, covers a very wide range of topics. As a result, the world of applied sciences heavily relies on graph theory.
Ali Al Khabyah +2 more
doaj +1 more source
Semidefinite programming and eigenvalue bounds for the graph partition problem
, 2015 The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized.
Sotirov, Renata, van Dam, Edwin R.
core +2 more sources
Advanced Biology, EarlyView.This study investigates the photosensitizing potential of Passiflora cincinnata in Antimicrobial Photodynamic Therapy (aPDT) against skin infection caused by Methicillin‐resistant Staphylococcus aureus (MRSA) in a senescent murine model. The P. cincinnata exhibits antimicrobial activity, with reduced bacterial load, lower leukocyte infiltration, and ...
Caroline Vieira Gonçalves +14 more
wiley +1 more source
On finding a satisfactory partition in an undirected graph: algorithm design and results
AIMS MathematicsA satisfactory partition is a partition of undirected-graph vertices such that the partition has only two nonempty parts, and every vertex has at least as many adjacent vertices in its part as it has in the other part.
Samer Nofal
doaj +1 more source
Query-Sensitive Graph Partitioner for Pattern Matching Applications
IEEE Access, 2019 Searching and mining in large graphs is critical to a variety of applications, at the core of which is the pattern matching activity. The scalable processing of large graphs requires careful distribution of graphs across clusters.
Li Lu, Bei Hua
doaj +1 more source
Computing the partition dimension of certain families of Toeplitz graph
Frontiers in Computational Neuroscience, 2022 Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v) between two vertices u, v that belong to the vertex set of H is the shortest path ...
Ricai Luo +5 more
doaj +1 more source