We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m,n) for 3 ≤ m < n and show that permutation decoding can be used for full error-correction for these codes by finding explicit information sets and PD-sets for these information sets.

It is known that interval-valued fuzzy sets provide a more adequate description of expert uncertainty than the more traditional “type-1” (number-valued) fuzzy techniques. In the current approaches for using interval-valued fuzzy techniques, it is usually assumed that all fuzzy sets m(x) ∈ [m(x), m(x)] are possible. In this paper, we show that it is reasonable to restrict ourselves only to fuzzy...

An m-cycle system of order v, denoted by mCS(v), is a decomposition of the complete graph Kv into m-cycles. We discuss two types of large sets of mCS(v) and construct examples of both types for (m, v) = (4, 9) and one type for (m, v) = (6, 9). These are the first large sets of cycle systems constructed with m > 3, apart from the Hamiltonian cycle decompositions given in [2]. AMS classification:...

Geomagnetic study was carried out to investigate the distribution and depth of formations of different magnetic rocks on an old quarry site, Abeokuta, Southwestern, Nigeria. Eight ground magnetic profiles were established with 10 m spacing intervals orientated in West-East and North-South directions, and ranged between 110 and 190 m. A total of 223 data sets were acquired and corrected for all ...

Content Analysis of the High School Textbooks in Iran from Information Literacy Perspective E. Ebraahimi Dorcheh M. Cheshmeh Sohraabi, Ph.D. M. R. Neyestaani, Ph.D. To determine the extent to which information literacy is utilized within the 10th grade textbooks across different disciplines, a sample of 19 textbooks from among 96 high school textbooks was selected. The instr...

The binary codes of the line graphs Lm(n) of the complete multipartite graphs Kn1,...,nm (ni = n for 1 ≤ i ≤ m) n ≥ 2, m ≥ 3 are examined, and PD-sets and s-PD-sets are found.

let $g=(v,e)$ be a‎ ‎simple graph of order $n$ and size $m$‎. ‎an $r$-matching of $g$ is ‎a set of $r$ edges of $g$ which no two of them have common vertex‎. ‎the hosoya index $z(g)$ of a graph $g$ is defined as the total‎ ‎number of its matchings‎. ‎an independent set of $g$ is a set of‎ ‎vertices where no two vertices are adjacent‎. ‎the ‎merrifield-simmons index of $g$ is defined as the tota...

Moulton and Develin have investigated the notion of representing various sets S of positive integers, of size m say, as subset sums of smaller sets. The rank of a given set S is the smallest positive integer rk(S) ≤ m such that S is represented by an integer set of size rk(S). In this note, we primarily consider sets of the form {1, 2, 3, . . .} for positive integer m ≥ 2. Given a positive inte...