Search Results - "Discrete mathematics"

Independent domination in graphs: A survey and recent results by Goddard, Wayne, Henning, Michael A.

“…A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In…”
Get full text

A construction of binary linear codes from Boolean functions by Ding, Cunsheng

“…Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the…”
Get full text

The Aα-spectral radius for path-factors in graphs by Zhou, Sizhong, Zhang, Yuli, Sun, Zhiren

“…Let α∈[0,1), and let G be a connected graph of order n with n≥f(α), where f(α)=14 for α∈[0,12], f(α)=17 for α∈(12,23], f(α)=20 for α∈(23,34] and f(α)=51−α+1…”
Get full text

Hamming weights in irreducible cyclic codes by Ding, Cunsheng, Yang, Jing

“…The objectives of this paper are to survey and extend earlier results on the weight distributions of irreducible cyclic codes, present a divisibility theorem…”
Get full text

State transfer on graphs by Godsil, Chris

“…If X is a graph with adjacency matrix A, then we define H(t) to be the operator exp(itA). We say that we have perfect state transfer in X from the vertex u to…”
Get full text

Three-weight cyclic codes and their weight distributions by Ding, Cunsheng, Li, Chunlei, Li, Nian, Zhou, Zhengchun

“…Cyclic codes have been an important topic of both mathematics and engineering for decades. They have been widely used in consumer electronics, data…”
Get full text

Near MDS codes from oval polynomials by Wang, Qiuyan, Heng, Ziling

“…A linear code with parameters of the form [n,k,n−k+1] is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form…”
Get full text

Adjacency eigenvalues of graphs without short odd cycles by Li, Shuchao, Sun, Wanting, Yu, Yuantian

“…It is well known that spectral Turán type problem is one of the most classical problems in graph theory. In this paper, we consider the spectral Turán type…”
Get full text

D-index and Q-index for spanning trees with leaf degree at most k in graphs by Zhou, Sizhong, Sun, Zhiren, Liu, Hongxia

“…Let G be a connected graph and let k be a positive integer. Let T be a spanning tree of G. The leaf degree of a vertex v∈V(T) is defined as the number of…”
Get full text

On the spectral radius of graphs without a star forest by Chen, Ming-Zhu, Liu, A-Ming, Zhang, Xiao-Dong

“…Let F=∪i=1kSdi be the union of pairwise vertex-disjoint k stars of order d1+1,…,dk+1, respectively, where k≥2 and d1≥⋯≥dk≥1. In this paper, we present two…”
Get full text

The spectral radius of graphs with no intersecting odd cycles by Li, Yongtao, Peng, Yuejian

“…Let Hs,t1,…,tk be the graph with s triangles and k odd cycles of lengths t1,…,tk≥5 intersecting in exactly one common vertex. Recently, Hou et al. (2018) [27],…”
Get full text

Colorings of plane graphs: A survey by Borodin, O.V.

“…After a brief historical account, a few simple structural theorems about plane graphs useful for coloring are stated, and two simple applications of…”
Get full text

Twin-width and generalized coloring numbers by Dreier, Jan, Gajarský, Jakub, Jiang, Yiting, Ossona de Mendez, Patrice, Raymond, Jean-Florent

“…In this paper, we prove that a graph G with no Ks,s-subgraph and twin-width d has r-admissibility and r-coloring numbers bounded from above by an exponential…”
Get full text

New infinite families of near MDS codes holding t-designs by Heng, Ziling, Wang, Xinran

“…In “Infinite families of near MDS codes holding t-designs, IEEE Trans. Inform. Theory, 2020, 66(9), pp. 5419-5428”, Ding and Tang made a breakthrough in…”
Get full text

Dimensions of three types of BCH codes over GF(q) by Liu, Hao, Ding, Cunsheng, Li, Chengju

“…BCH codes have been studied for over fifty years and widely employed in consumer devices, communication systems, and data storage systems. However, the…”
Get full text

On ve-degrees and ev-degrees in graphs by Chellali, Mustapha, Haynes, Teresa W., Hedetniemi, Stephen T., Lewis, Thomas M.

“…Let G=(V,E) be a graph with vertex set V and edge set E. A vertex v∈Vve-dominates every edge incident to it as well as every edge adjacent to these incident…”
Get full text

A context-free grammar for the e-positivity of the trivariate second-order Eulerian polynomials by Chen, William Y.C., Fu, Amy M.

“…Ma-Ma-Yeh made a beautiful observation that a transformation of the grammar of Dumont instantly leads to the γ-positivity of the Eulerian polynomials. We…”
Get full text

Evasive subspaces, generalized rank weights and near MRD codes by Marino, Giuseppe, Neri, Alessandro, Trombetti, Rocco

“…We revisit and extend the connections between Fqm-linear rank-metric codes and evasive Fq-subspaces of Fqmk. We give a unifying framework in which we prove in…”
Get full text

An introduction to the discharging method via graph coloring by Cranston, Daniel W., West, Douglas B.

“…We provide a “how-to” guide to the use and application of the Discharging Method. Our aim is not to exhaustively survey results proved by this technique, but…”
Get full text

Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth by Liu, Chun-Hung

“…Proper conflict-free coloring is an intermediate notion between proper coloring of a graph and proper coloring of its square. It is a proper coloring such that…”
Get full text