Results 31 to 40 of about 316,576 (301)
On the edge chromatic vertex stability number of graphs
AKCE International Journal of Graphs and Combinatorics, 2023 For an arbitrary invariant [Formula: see text] of a graph G, the [Formula: see text]vertex stability number [Formula: see text] is the minimum number of vertices of G whose removal results in a graph [Formula: see text] with [Formula: see text] or with ...
Saeid Alikhani, Mohammad R. Piri
doaj +1 more source
High-Level Petri Nets as Type Theories in the Join Calculus [PDF]
, 2001 We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiveness, $PN_i$, introduce a hierarchy of type ...
Buscemi, Maria Grazia +6 more
core +1 more source
On partial inverse operations in the class of preradicals of modules
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In the present work two partial operations in the class of preradicals ℙℝ of the category R-Mod of left R-modules are defined and investigated. They are inverse operations for product with respect to meet and coproduct with respect to join.
Jardan Ion
doaj +1 more source
Certain Operations on Complex Picture Fuzzy Graphs
IEEE Access, 2022 A complex picture fuzzy set (Com-PFS) is a motivating tool for more precisely interpreting fuzzy notions. Recently, all extensions of complex fuzzy graphs (Com-FGs) have become a growing research topic as they handle ambiguous situations more explicitly ...
Muhammad Shoaib +4 more
doaj +1 more source
On Noncommutative Joinings [PDF]
International Mathematics Research Notices, 2017 This paper extends the classical theory of joinings of measurable dynamical systems to the noncommutative setting from several interconnected points of view. Among these is a particularly fruitful identification of joinings with equivariant quantum channels between $W^{\ast}$-dynamical systems that provides noncommutative generalizations of many ...
Bannon, Jon P. +2 more
openaire +3 more sources
The (Strong) Rainbow Connection Number of Join Of Ladder and Trivial Graph
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can be considered as a rainbow k-coloring if every two vertices x and y in G has an x- y path.
Dinda Kartika +2 more
doaj +1 more source
To join or not to join: collective foraging strategies
Journal of Physics: Conference Series, 2015 We present a minimal model to address the issue of how the interaction between foragers influence their encounter rates with resources. We consider a two-dimensional lattice model to study the optimal strategy for a group of foragers (walkers) searching for targets distributed heterogeneously. A forager who has not detected any target has the choice of,
Kunal Bhattacharya, Tamás Vicsek
openaire +1 more source
The Joint Observation in Neonatology and Neurodevelopmental Outcome of Preterm Infants at Six Months Corrected Age: Secondary Outcome Data from a Randomised Controlled Trial [PDF]
, 2022 This study aimed to evaluate the impact of a standardised joint observation (JOIN) performed in the neonatal intensive care unit (NICU) on the neurodevelopment of preterm infants at six months corrected age (CA) compared with a preterm control group.
Mathilde Morisod Harari +14 more
core +1 more source
Results on Laplacian spectra of graphs with pockets
AKCE International Journal of Graphs and Combinatorics, 2018 Let be simple connected graphs on and vertices, respectively. Let be a specified vertex of and . Then the graph obtained by taking one copy of and copies of and then attaching the th copy of to the vertex , , at the vertex of (identify with the vertex of
Sasmita Barik, Gopinath Sahoo
doaj +1 more source
Monophonic Distance Energy for Join of Some Graphs
Ratio Mathematica, 2023 Let G be a connected graph with n vertices and m edges. Let µ1, µ2 ,..., µn be the Eigen values of distance matrix of G. The distance energy of a graph ED (G) = \sum_{i=1}^{p}\left|{\mu_i}^\ \right|,was already studied.
V S Sinju Manohar, T Binu Selin
doaj +1 more source