Results 41 to 50 of about 35,638 (292)
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
On the characterization of rectangular duals [PDF]
Notes on Number Theory and Discrete MathematicsA rectangular partition is a partition of a rectangle into a finite number of rectangles. A rectangular partition is generic if no four of its rectangles meet at the same point.
Vinod Kumar, Krishnendra Shekhawat
doaj +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
Advanced Engineering Materials, EarlyView.This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar +6 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.This study presents micropleated filters manufactured by needleless electrospinning. Nanofibers are deposited onto uniaxially pre‐stretched substrates that contract upon release, forming densely packed micropleats. This architecture increases effective surface area without enlarging the filter size, achieving quality factors comparable to those of ...
Aleksandr Fadeev +6 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
\(k\)-efficient partitions of graphs
Communications in Combinatorics and Optimization, 2019 Summary: A set \(S = \{u_1,u_2, \dots, u_t\}\) of vertices of \(G\) is an efficient dominating set if every vertex of \(G\) is dominated exactly once by the vertices of \(S\). Letting \(U_i\) denote the set of vertices dominated by \(u_i\), we note that \(\{U_1, U_2, \dots, U_t\}\) is a partition of the vertex set of \(G\) and that each \(U_i ...
Chellali, Mustapha +2 more
openaire +4 more sources
Advanced Engineering Materials, EarlyView.An idea of designing novel sensors is proposed by creating appropriate Schottky barriers and vacancies between isomorphous Core‐CuOii/ Shell‐CuOi secondary microspheres and enhancing catalytic and spill‐over effects, and electronegativity via spontaneous biphasic separation, self‐assembly, and trace‐Ni‐doping.
Bala Ismail Adamu +8 more
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
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