Relevant bibliographies by topics / Degree

Contents

  1. Journal articles

Academic literature on the topic 'Degree'

Author: Grafiati
Published: 4 June 2021
Last updated: 12 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Degree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Degree"

1

van der Hofstad, Remco, and Nelly Litvak. "Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees." Internet Mathematics 10, no. 3-4 (2014): 287–334. http://dx.doi.org/10.1080/15427951.2013.850455.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

van der Hoorn, Pim, and Nelly Litvak. "Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees." Internet Mathematics 11, no. 2 (2014): 155–79. http://dx.doi.org/10.1080/15427951.2014.927038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Soskova, A. A., and I. N. Soskov. "Quasi-minimal degrees for degree spectra." Journal of Logic and Computation 23, no. 6 (2013): 1319–34. http://dx.doi.org/10.1093/logcom/ext045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gobeski, Adam, and Marcin Morzycki. "Percentages, Relational Degrees, and Degree Constructions." Semantics and Linguistic Theory 27 (August 3, 2018): 721. http://dx.doi.org/10.3765/salt.v27i0.4142.

Full text
Abstract:
Comparatives and equatives are usually assumed to differ only in that comparatives require that one degree be greater than another, while equatives require that it be at least as great. Unexpectedly, though, the interpretation of percentage measure phrases differs fundamentally between the constructions. This curious asymmetry is, we suggest, revealing. It demonstrates that comparatives and equatives are not as similar as one might have thought. We propose an analysis of these facts in which the interpretation of percentage phrases follows straightforwardly from standard assumptions enriched with two additional ones: that percentage phrases denote ‘relational degrees’ (type <d,d>) and that the equative morpheme is uninterpreted.
APA, Harvard, Vancouver, ISO, and other styles
5

Huppert, Bertram, and Olaf Manz. "Degree-problems I squarefree character degrees." Archiv der Mathematik 45, no. 2 (1985): 125–32. http://dx.doi.org/10.1007/bf01270483.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Manz, Olaf. "Degree problems II π - separable character degrees". Communications in Algebra 13, № 11 (1985): 2421–31. http://dx.doi.org/10.1080/00927878508823281.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Webb, Susan, Elizabeth Knight, and Steven Hodge. "‘A degree is a degree’: understanding vocational institution’s bachelor degrees in Australia’s high participation system." International Journal of Training Research 18, no. 2 (2020): 93–100. http://dx.doi.org/10.1080/14480220.2021.1883839.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Arumugam, S., and Latha Martin. "Degrees and degree sequence ofk-edged-critical graphs." Journal of Discrete Mathematical Sciences and Cryptography 14, no. 5 (2011): 421–29. http://dx.doi.org/10.1080/09720529.2011.10698346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ramos, Marlon, and Celia Anteneodo. "Random degree–degree correlated networks." Journal of Statistical Mechanics: Theory and Experiment 2013, no. 02 (2013): P02024. http://dx.doi.org/10.1088/1742-5468/2013/02/p02024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

MUKWEMBI, S., and S. MUNYIRA. "DEGREE DISTANCE AND MINIMUM DEGREE." Bulletin of the Australian Mathematical Society 87, no. 2 (2012): 255–71. http://dx.doi.org/10.1017/s0004972712000354.

Full text
Abstract:
AbstractLet G be a finite connected graph of order n, minimum degree δ and diameter d. The degree distance D′(G) of G is defined as ∑ {u,v}⊆V (G)(deg u+deg v) d(u,v), where deg w is the degree of vertex w and d(u,v) denotes the distance between u and v. In this paper, we find an asymptotically sharp upper bound on the degree distance in terms of order, minimum degree and diameter. In particular, we prove that \[ D^\prime (G)\le \frac {1}{4}\,dn\biggl (n-\frac {d}{3}(\delta +1)\biggr )^2+O(n^3). \] As a corollary, we obtain the bound D′ (G)≤n4 /(9(δ+1) )+O(n3) for a graph G of order n and minimum degree δ. This result, apart from improving on a result of Dankelmann et al. [‘On the degree distance of a graph’, Discrete Appl. Math.157 (2009), 2773–2777] for graphs of given order and minimum degree, completely settles a conjecture of Tomescu [‘Some extremal properties of the degree distance of a graph’, Discrete Appl. Math.98(1999), 159–163].
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Degree' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography