DSpace Repository

Browsing Master of Mathematics by Title

Browsing Master of Mathematics by Title

Sort by: Order: Results:

  • Qunaibi, Abeer (جامعة بوليتكنك فلسطين - ماجستير رياضيات, 2009-12-01)
    This thesis introduces the concepts of solvable and nilpotent groups and presents important definitions like supersolvable groups, polycyclic groups, Carter subgroups, metabelian groups ,hypercentral groups, HM= groups, ...
  • Rasheed, Fatima (جامعة بوليتكنك فلسطين - ماجستير رياضيات, 2021-05-01)
    A real matrix is called totally nonnegative or totally positive if all minors are nonnegative or positive, respectively. In this thesis, we derive the condensed form of the Restoration Algorithm which is a new result and ...
  • Fasfous, Maryam (جامعة بوليتكنك فلسطين - رياضيات, 9/1/2017)
    In this thesis, we study the main well known results in graph theory. In particular, we study many formulation and properties of finite simple graphs through their matrix representation such as incidence and adjacency ...
  • Al- Natsheh, Maram (جامعة بوليتكنك فلسطين - ماجستير رياضيات, 2009-12-01)
    This thesis aims to develop a better understanding of lattices. P] presents lattices, types of lattices and discusses three applications of complete lattices. Due to the importance of orders and ordered sets ]% study ...
  • Nashawieh, Kholoud (جامعة بوليتكنك فلسطين - ماجستير رياضيات, 2016-12-01)
    The variational iteration method (VIM) is a powerful method for solving a wide class of linear and nonlinear problems, first introduced by the Chinese mathematician He in 1999. This method is based on the use of Lagrange ...
  • Farajallah, Warda (جامعة بوليتكنك فلسطين - رياضيات, 10/1/2017)
    Winding number is an important and familiar mathematical concept which is used in several medical and research areas such that in electro cardiology. In two dimensions, for any given polygon P we mean by winding number of ...
  • Abughiyatha, Hadil (جامعة بوليتكنك فلسطين - رياضيات, 6/1/2020)
    The zero forcing game on a simple, undirected graph G is based on the so-called color change rule which can be stated as if some vertices on G are colored black while others are white and vertex v is a black vertex with ...

Search DSpace


Browse

My Account