Demonstratio Mathematica - Journal - Bridge of Knowledge

Search

Demonstratio Mathematica

ISSN:

0420-1213

eISSN:

2391-4661

Disciplines
(Field of Science):

  • Mathematics (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 20 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 20 Ministry scored journals list 2024
2023 20 Ministry Scored Journals List
2022 20 Ministry Scored Journals List 2019-2022
2021 20 Ministry Scored Journals List 2019-2022
2020 20 Ministry Scored Journals List 2019-2022
2019 20 Ministry Scored Journals List 2019-2022
2018 11 B
2017 11 B
2016 11 B
2015 11 B
2014 8 B
2013 8 B
2012 8 B
2011 8 B
2010 9 B

Model:

Open Access

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 2.7
Points CiteScore - previous years
Year Points
2022 2.7
2021 2.8
2020 1.7
2019 0.8
2018 0.7
2017 0.6

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 5

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2016
Year 2014
  • Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
    Publication

    - Demonstratio Mathematica - Year 2014

    Birth–and–death models are now a common mathematical tool to describe branching patterns observed in real–world phylogenetic trees. Liggett and Schinazi (2009) is one such example. The authors propose a simple birth–and–death model that is compatible with phylogenetic trees of both influenza and HIV, depending on the birth rate parameter. An interesting special case of this model is the critical case where the birth rate equals the...

    Full text available to download

Year 2012
  • A lower bound on the double outer-independent domination number of a tree
    Publication

    A vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...

    Full text available to download

Year 2010
Year 2007

seen 447 times