Log in

Relevant bibliographies by topics / Degree / Journal articles

To see the other types of publications on this topic, follow the link: Degree.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Allahbakhshi, Mahsa. "Computing degree and class degree." Theoretical Computer Science 535 (May 2014): 59–64. http://dx.doi.org/10.1016/j.tcs.2014.04.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Knight, Jane. "Are Double/Multiple Degree Programs Leading to “Discount Degrees”?" International Higher Education, no. 81 (May 1, 2015): 5–7. http://dx.doi.org/10.6017/ihe.2015.81.8729.

Full text

Abstract:

The growth in double/multiple degree programs around the world, especially in Europe and Asia, is unprecedented. While the benefits for both students and institutions are many, there is increasing concern about the integrity and legitimacy of those programs which double count credits for two or more qualifications. Challenging questions about the quality assurance, accreditation, recognition an ethics of double/multiple degree programs are posed.

APA, Harvard, Vancouver, ISO, and other styles

13

Haught, Christine Ann. "The degrees below a 1-generic degree < 0′." Journal of Symbolic Logic 51, no. 3 (1986): 770–77. http://dx.doi.org/10.2307/2274030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Ding, Decheng, and Lei Qian. "Isolated d.r.e. degrees are dense in r.e. degree structure." Archive for Mathematical Logic 36, no. 1 (1996): 1–10. http://dx.doi.org/10.1007/s001530050053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Shen, Wanqiang, Ping Yin, and Chengjie Tan. "Degree elevation of changeable degree spline." Journal of Computational and Applied Mathematics 300 (July 2016): 56–67. http://dx.doi.org/10.1016/j.cam.2015.11.030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Matsuda, Haruhide, and Hajime Matsumura. "Degree conditions and degree bounded trees." Discrete Mathematics 309, no. 11 (2009): 3653–58. http://dx.doi.org/10.1016/j.disc.2007.12.099.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Matsumura, Hajime. "Degree Conditions and Degree Bounded Trees." Electronic Notes in Discrete Mathematics 22 (October 2005): 295–98. http://dx.doi.org/10.1016/j.endm.2005.06.048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Mynhardt, Christina M. "Degree sets of degree uniform graphs." Graphs and Combinatorics 1, no. 1 (1985): 283–90. http://dx.doi.org/10.1007/bf02582953.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Delen, Sadik, Riaz Hussain Khan, Muhammad Kamran, et al. "Ve-Degree, Ev-Degree, and Degree-Based Topological Indices of Fenofibrate." Journal of Mathematics 2022 (August 21, 2022): 1–6. http://dx.doi.org/10.1155/2022/4477808.

Full text

Abstract:

The molecular topology of a graph is described by topological indices, which are numerical measures. In theoretical chemistry, topological indices are numerical quantities that are used to represent the molecular topology of networks. These topological indices can be used to calculate several physical and chemical properties of chemical compounds, such as boiling point, entropy, heat generation, and vaporization enthalpy. Graph theory comes in handy when looking at the link between certain topological indices of some derived graphs. In the ongoing research, we determine ve-degree, ev-degree, and degree-based (D-based) topological indices of fenofibrate’s chemical structure. These topological indices are the Zagreb index, general Randić index, modified Zagreb index, and forgotten topological index. These indices are very helpful to study the characterization of the given structure.

APA, Harvard, Vancouver, ISO, and other styles

20

Čibej, Uroš, Aaron Li, István Miklós, Sohaib Nasir, and Varun Srikanth. "Constructing bounded degree graphs with prescribed degree and neighbor degree sequences." Discrete Applied Mathematics 332 (June 2023): 47–61. http://dx.doi.org/10.1016/j.dam.2023.02.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Jones, Chris, and Karoline Wiesner. "Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness." Entropy 24, no. 9 (2022): 1182. http://dx.doi.org/10.3390/e24091182.

Full text

Abstract:

It is often claimed that the entropy of a network’s degree distribution is a proxy for its robustness. Here, we clarify the link between degree distribution entropy and giant component robustness to node removal by showing that the former merely sets a lower bound to the latter for randomly configured networks when no other network characteristics are specified. Furthermore, we show that, for networks of fixed expected degree that follow degree distributions of the same form, the degree distribution entropy is not indicative of robustness. By contrast, we show that the remaining degree entropy and robustness have a positive monotonic relationship and give an analytic expression for the remaining degree entropy of the log-normal distribution. We also show that degree-degree correlations are not by themselves indicative of a network’s robustness for real networks. We propose an adjustment to how mutual information is measured which better encapsulates structural properties related to robustness.

APA, Harvard, Vancouver, ISO, and other styles

22

Xiong, Jiajuan, and Feng-fan Hsieh. "Same Degree of Intensification with Different Degrees of Sentential Projections." Lingua sinica 7, no. 1 (2021): 1–22. http://dx.doi.org/10.2478/linguasinica-2021-0001.

Full text

Abstract:

Abstract In Chengdu Chinese, degree intensifiers for APs/VPs are attested to pair with three different types of sentence-final particles (SFPs), i.e., the FinP-level, the FocP-level and the ExclP-level SFPs, which function to complete a sentence, encode a focus and express exclamation. In our analysis, a degree intensifier projects a DegP, which pairs with one of the three sentential projections, viz., FinP, FocP and ExclP. This pairing is motivated by feature checking, as intensifiers contain the uninterpretable semantic features of [+Fin], [+Foc] or [+Excl], which need to be checked by sentential projections. Due to the inalienable sentential functions, intensifiers are barred from occurring in any kind of non-finite contexts. Furthermore, FinP and FocP are within the vP-domain, whereas ExclP is in the CP domain. Thus, ExclP-type intensifiers, unlike FinP-type and FocP-type intensifiers, defy relativization. This study of associating degree intensification with sentential functions not only explains the syntactic behaviors of Chengdu intensifiers but also sheds new light on the well-known Mandarin hen puzzle.

APA, Harvard, Vancouver, ISO, and other styles

23

Smith, Quentin. "Time and Degrees of Existence: A Theory of ‘Degree Presentism’." Royal Institute of Philosophy Supplement 50 (March 2002): 119–36. http://dx.doi.org/10.1017/s1358246100010535.

Full text

Abstract:

It seems intuitively obvious that what I am doing right now is more real than what I did just one second ago, and it seems intuitively obvious that what I did just one second ago is more real than what I did forty years ago. And yet, remarkably, every philosopher of time today, except for the author, denies this obvious fact about reality. What went wrong? How could philosophers get so far away from what is the most experientially evident fact about reality?

APA, Harvard, Vancouver, ISO, and other styles

24

Johnson, P. D., and R. L. Perry. "Inequalities Relating Degrees of Adjacent Vertices to the Average Degree." European Journal of Combinatorics 7, no. 3 (1986): 237–41. http://dx.doi.org/10.1016/s0195-6698(86)80028-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Balcerak Jackson, Brendan, and Doris Penka. "Number word constructions, degree semantics and the metaphysics of degrees." Linguistics and Philosophy 40, no. 4 (2017): 347–72. http://dx.doi.org/10.1007/s10988-017-9213-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Kawaguchi, Shu, and Joseph H. Silverman. "Examples of dynamical degree equals arithmetic degree." Michigan Mathematical Journal 63, no. 1 (2014): 41–63. http://dx.doi.org/10.1307/mmj/1395234358.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Sklyarenko, Evgenii G. "The homological degree and Hopf's absolute degree." Sbornik: Mathematics 199, no. 11 (2008): 1687–713. http://dx.doi.org/10.1070/sm2008v199n11abeh003977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

de Arruda, Guilherme Ferraz, Emanuele Cozzo, Yamir Moreno, and Francisco A. Rodrigues. "On degree–degree correlations in multilayer networks." Physica D: Nonlinear Phenomena 323-324 (June 2016): 5–11. http://dx.doi.org/10.1016/j.physd.2015.11.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

kumar, Sunil, and Hosamani M. "Degree Equitable Domination in Semigraphs." Journal of Computational Mathematica 1, no. 2 (2017): 40–45. http://dx.doi.org/10.26524/cm14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Patil, Aishwarya M., and Dr C. S. Dalvi. "720 Degree Performance Appraisal Systems." International Journal of Trend in Scientific Research and Development Special Issue, Special Issue-FIIIIPM2019 (2019): 4–8. http://dx.doi.org/10.31142/ijtsrd23048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Zhou, Yu, and Xin Zhong Lu. "The Application of Crime Network Conspirator Finding Model." Applied Mechanics and Materials 513-517 (February 2014): 420–23. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.420.

Full text

Abstract:

This paper discusses how to find out conspirators when only know the topics of messages they sent and received. In order to determine the weight of every topic, we establish AHP model and CNC (Crime Network conspirator finding) model to define possibility, which includes three parameters: the relative connection degreeC(h) , the relative intermediate degree I and the I(h)relative tightness degreeT(h). After that, obtaining scores by synthesizing these three degrees and get a prior list. Through analyzing the list, we can determine the suspected conspirators.

APA, Harvard, Vancouver, ISO, and other styles

32

Gunderson, Terry. "Degree Titles." Music Educators Journal 83, no. 4 (1997): 6. http://dx.doi.org/10.2307/3399032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Mellers, Wilfrid, and Robert Burns. "First Degree." Musical Times 137, no. 1842 (1996): 23. http://dx.doi.org/10.2307/1003959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Parry, Robert, and Roger Cobley. "Third degree." Nursing Standard 11, no. 51 (1997): 18. http://dx.doi.org/10.7748/ns.11.51.18.s29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Neeleman, Ad, Hans van de Koot, and Jenny Doetjes. "Degree expressions." Linguistic Review 21, no. 1 (2004): 1–66. http://dx.doi.org/10.1515/tlir.2004.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Pendleton, Stella. "Degree education." Nursing Standard 5, no. 6 (1990): 54. http://dx.doi.org/10.7748/ns.5.6.54.s60.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

González Escribano, José Luis. "Degree phrases." Revista Alicantina de Estudios Ingleses, no. 15 (2002): 49–77. http://dx.doi.org/10.14198/raei.2002.15.04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Marwieh, Nyonoweh. "Degree Compensation." AJN, American Journal of Nursing 115, no. 6 (2015): 13. http://dx.doi.org/10.1097/01.naj.0000466296.69379.50.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Han, Zuhong. "top degree." Duke Mathematical Journal 87, no. 1 (1997): 1–28. http://dx.doi.org/10.1215/s0012-7094-97-08701-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Westine, John R. "One Degree." Journal of the American Dental Association 124, no. 11 (1993): 18–20. http://dx.doi.org/10.14219/jada.archive.1993.0217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Jones, Gareth. "Degree standards." Physics World 15, no. 3 (2002): 21. http://dx.doi.org/10.1088/2058-7058/15/3/26.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Baugh, Mark A., and William J. Docktor. "Degree nomenclature." American Journal of Health-System Pharmacy 49, no. 5 (1992): 1111–12. http://dx.doi.org/10.1093/ajhp/49.5.1111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

MOREAU., R. E. "HONORARY DEGREE." Ibis 94, no. 2 (2008): 370–71. http://dx.doi.org/10.1111/j.1474-919x.1952.tb01834.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

. "Associate degree." Onderwijs en gezondheidszorg 29, no. 1 (2005): 4. http://dx.doi.org/10.1007/bf03071440.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Scalzi, Cynthia C., and Ruth A. Anderson. "Dual Degree." JONA: The Journal of Nursing Administration 19, no. 6 (1989): 25???29. http://dx.doi.org/10.1097/00005110-198906010-00009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Gustafson, Karl. "Normal degree." Numerical Linear Algebra with Applications 11, no. 7 (2004): 661–74. http://dx.doi.org/10.1002/nla.369.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Sutton, Halley. "Support degree reclamation with disaggregated data, degree mining." Successful Registrar 21, no. 11 (2021): 6–7. http://dx.doi.org/10.1002/tsr.30922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Sutton, Halley. "Support degree reclamation with disaggregated data, degree mining." Recruiting & Retaining Adult Learners 24, no. 3 (2021): 6–7. http://dx.doi.org/10.1002/nsr.30812.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Sutton, Halley. "Support degree reclamation with disaggregated data, degree mining." Dean and Provost 23, no. 5 (2021): 7–8. http://dx.doi.org/10.1002/dap.30978.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Sutton, Halley. "Support degree reclamation with disaggregated data, degree mining." Enrollment Management Report 25, no. 11 (2022): 6–7. http://dx.doi.org/10.1002/emt.30884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!