Mathematics - Journal - Bridge of Knowledge

Search

Mathematics

ISSN:

2227-7390

Publisher:

MDPI

Disciplines
(Field of Science):

  • Civil engineering, geodesy and transport (Engineering and Technology)
  • 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

Model:

Open Access

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 3.5
Points CiteScore - previous years
Year Points
2022 3.5
2021 2.9
2020 2.2
2019 1.4
2018 1
2017 1.1

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 5

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2022
Year 2021
  • Isolation Number versus Domination Number of Trees
    Publication
    • M. Lemańska
    • M. J. Souto-Salorio
    • A. Dapena
    • F. Vazquez-Araujo

    - Mathematics - Year 2021

    If G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....

    Full text available to download

  • Progress on Roman and Weakly Connected Roman Graphs
    Publication

    - Mathematics - Year 2021

    A graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....

    Full text available to download

Year 2020
  • Characterization of the Functionally Graded Shear Modulus of a Half-Space
    Publication

    - Mathematics - Year 2020

    In this article, a method is proposed for determining parameters of the exponentialy varying shear modulus of a functionally graded half-space. The method is based on the analytical solution of the problem of pure shear of an elastic functionally graded half-space by a strip punch. The half-space has the depth-wise exponential variation of its shear modulus, whose parameters are to be determined. The problem is reduced to an integral...

    Full text available to download

  • Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
    Publication

    Consider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...

    Full text available to download

seen 660 times