Results 11 to 20 of about 1,611,510 (293)
Remarks on the Balaban Index [PDF]
In this paper we compute some bounds of the Balaban index and then by means of group action we compute the Balaban index of vertex transitive graphs. ACM Computing Classification System (1998): G.2.2 , F.2.2.
M. Ghorbani
semanticscholar +3 more sources
Final report of the E821 muon anomalous magnetic moment measurement at BNL [PDF]
We present the final report from a series of precision measurements of the muon anomalous magnetic moment, a(mu)=(g-2)/2. The details of the experimental method, apparatus, data taking, and analysis are summarized.
M. Bennett, E. al.
semanticscholar +1 more source
EXAMINING THE SOCIAL BEHAVIOR OF ANT COLONIES USING COMPLEX NETWORKS [PDF]
This paper proposes the use of Complex Network Theory to model the interactions between ants and analyze their social behavior. Specifically, the study focuses on six colonies of ants to investigate whether their behavior is community-oriented or ...
MURSA, Bogdan
core +2 more sources
On the monophonic rank of a graph [PDF]
A set of vertices $S$ of a graph $G$ is {\em monophonically convex} if every induced path joining two vertices of $S$ is contained in $S$. The {\em monophonic convex hull of $S$}, $\langle S \rangle$, is the smallest monophonically convex set containing $
Mitre C. Dourado+2 more
doaj +1 more source
A Study of $k$-dipath Colourings of Oriented Graphs [PDF]
We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the case $k=2$ is
Christopher Duffy+2 more
doaj +1 more source
On path-cycle decompositions of triangle-free graphs [PDF]
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length.
Andrea Jiménez, Yoshiko Wakabayashi
doaj +1 more source
Some theorems on passing from local to global presence of properties of functions [PDF]
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to all of them ...
Dimiter Skordev
doaj +1 more source
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix [PDF]
This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is equivalent to the problem of uniqueness of a perfect ...
Lê Thành Dũng Nguyên
doaj +1 more source
On Minimum Maximal Distance-k Matchings [PDF]
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +1 more source
Rule Algebras for Adhesive Categories [PDF]
We demonstrate that the most well-known approach to rewriting graphical structures, the Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules along an overlap that is associative in a natural sense.
Nicolas Behr, Pawel Sobocinski
doaj +1 more source