Results 41 to 50 of about 46,626 (239)
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
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
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
Newton polytopes in algebraic combinatorics [PDF]
Selecta Mathematica, 2017 A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally): skew Schur ...
C. Monical, Neriman Tokcan, A. Yong
semanticscholar +1 more source
Well quasi-order in combinatorics : embeddings and homomorphisms
, 2015 The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame ...
Ruskuc, Nik +3 more
core +1 more source
International Journal of Mathematical Combinatorics, Vol.1 [PDF]
, 2007 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
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
Complexity problems in enumerative combinatorics [PDF]
International Congress of Mathematicans, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
I. Pak
semanticscholar +1 more source