Results 31 to 40 of about 144,275 (215)
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
Indonesian Journal of Combinatorics, 2021 A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati +2 more
doaj +1 more source
Hopf algebras and the combinatorics of connected graphs in quantum field theory
, 2008 In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators.
Mestre, Angela, Oeckl, Robert
core +1 more source
Smith Normal Form in Combinatorics [PDF]
, 2015 This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith normal form of ...
Stanley, Richard P.
core +1 more source
On the Combinatorics of Smoothing [PDF]
Journal of Mathematical Sciences, 2016 Many invariants of knots rely upon smoothing the knot at its crossings. To compute them, it is necessary to know how to count the number of connected components the knot diagram is broken into after the smoothing. In this paper, it is shown how to use a modification of a theorem of Zulli together with a modification of the spectral theory of graphs to ...
openaire +2 more sources
Skew Randi'c matrix and skew Randi'c energy [PDF]
Transactions on Combinatorics, 2016 Let $G$ be a simple graph with an orientation $sigma$, which assigns to each edge a direction so that $G^sigma$ becomes a directed graph. $G$ is said to be the underlying graph of the directed graph $G^sigma$.
Ran Gu, Fei Huang, Xueliang Li
doaj
Backbone colouring and algorithms for TDMA scheduling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring ...
Julien Bensmail +4 more
doaj +1 more source
Transactions of the American Mathematical Society, 2006 In this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results contain (a) a block partition Ramsey theorem for every countable ordinal xi (Hindman's theorem corresponding to xi ...
Farmaki, V., Negrepontis, S.
openaire +4 more sources
The 3-Rainbow Index of a Graph
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Chen Lily +3 more
doaj +1 more source
Rainbow Connection Number of Graphs with Diameter 3
Discussiones Mathematicae Graph Theory, 2017 A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj +1 more source
Constructing elliptic curve isogenies in quantum subexponential time
Journal of Mathematical Cryptology, 2014 Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew +2 more
doaj +1 more source