Results 31 to 40 of about 87,555 (181)
On Some Properties of Antipodal Partial Cubes
Discussiones Mathematicae Graph Theory, 2020 We prove that an antipodal bipartite graph is a partial cube if and only it is interval monotone. Several characterizations of the principal cycles of an antipodal partial cube are given.
Polat Norbert
doaj +1 more source
Biometric relations of freshwater fishes of the Suaza River (Huila Department, Colombia) [PDF]
Acta Ichthyologica et Piscatoria, 2016 The knowledge of freshwater fishes in remote Andean mountains is scarce and restricted to changes of occurrence distribution along a specific gradient.
I. Tobes +3 more
doaj +3 more sources
Exhaustive generation of $k$-critical $\mathcal H$-free graphs [PDF]
, 2015 We describe an algorithm for generating all $k$-critical $\mathcal H$-free graphs, based on a method of Ho\`{a}ng et al. Using this algorithm, we prove that there are only finitely many $4$-critical $(P_7,C_k)$-free graphs, for both $k=4$ and $k=5$.
B Randerath +17 more
core +1 more source
Diameter and girth of Torsion Graph
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let R be a commutative ring with identity. Let M be an R-module and T (M)* be the set of nonzero torsion elements. The set T(M)* makes up the vertices of the corresponding torsion graph, ΓR(M), with two distinct vertices x, y ∈ T(M)* forming an edge if ...
Rad P. Malakooti +3 more
doaj +1 more source
Scientia Agricola, 2007 Rubber tree cultivation [Hevea brasiliensis (Willd. ex Adr. de Juss.) Muell.-Arg.] uses mostly the budding propagation method, however the expected stand uniformity due to the use of vegetative propagation is theoretical, since high variation for yield ...
Átila Bento Beleti Cardinal +2 more
doaj +1 more source
Type-II QC-LDPC Codes From Multiplicative Subgroup of Prime Field
IEEE Access, 2020 A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel
Guohua Zhang +4 more
doaj +1 more source
Wiener index in graphs given girth, minimum, and maximum degrees
Theory and Applications of Graphs, 2023 Let $G$ be a connected graph of order $n$. The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$.
Fadekemi J. Osaye +3 more
doaj +1 more source
Fractional colorings of cubic graphs with large girth [PDF]
, 2010 We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n.
Kardos, Frantisek +2 more
core +4 more sources
Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs [PDF]
, 2016 In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph.
Abiad, A., Fiol, M. A., van Dam, E. R.
core +1 more source
Variables Affecting Thigh Girth Measurement and Observer Reliability in Dogs
Frontiers in Veterinary Science, 2018 Objective: The purpose of the study reported here was to describe variables affecting thigh girth measurements preoperatively and 2 weeks after surgical stabilization of the stifle and to examine inter- and intra-observer reliability.
Daniel A McCarthy +3 more
semanticscholar +1 more source