Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "By: Muhammad Azeem,"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    Cycle Labelings and Eccentric Base Invariants of Graphs
    (Library Information Services, COMSATS University, Lahore Campus, 2016) By: Muhammad Azeem,; FA14-BSM-014; Dr. Kashif Ali, Assistant Profesor; LHR TP 5259
    A simple graph G admits an H-covering if each edge in E(G) is a member of a sub graph of G isomorphic to H. An H-magic labeling λ of a graph G possessing an H-covering is a bijective function from the vertex-set and the edge-set of the graph Gonto the set {1,2,...,|V(G)|+|E(G)|} with a property that for every subgraph H of G isomorphic to H, the sum wtλ(H) = ∑ v∈V(H) λ(v)+ ∑ e∈E(H) λ(e) is equal to µ. The sum wtλ(H) is termed as, the H-weight. A graph is called H-supermagic if it possesses an H-supermagic labeling. Let G be a graph and v be a vertex of G. The eccentricity of the vertex v is the maximum distance from v to any vertex. That is, e(v) = max{d(v,w) : w ∈V(G)}. Firstly, we find the C4-supermagic labelings for the disjoint union of non-isomorphic copies of ladder graph, which are the generalization of the result proved in [21]. Moreover, we find the newclasses of 2-self centered graph namely uniform subdivided complete bipartite Kk n,m graph and line graph of uniform subdivided complete bipar tite graph L(Kk n,m). We also find their distance base topological indices of Kk n,m and L(Kk n,m). Then we also find eccentricity of uniform subdivided wheel graph, line graph of uniform subdivided wheel graph and their distance based topological indices
  • No Thumbnail Available
    Item
    Solution of Differential Equations by New Homotopy Perturbation Method
    (Library Information Services, COMSATS University, Lahore Campus, 2018) By: Muhammad Azeem,; FA14-BSM-009; Dr. Mohsan Hassan, Assistant Profesor [Supervisor]; LHR TP 5256
    In this project, a new modification of Homotopy perturbation method (HPM), called New Homotopy Perturbation Method (NHPM), has been applied for solving systems of non-linear partial differential equations. In chapter 2 we solved differential equations by HPM and in chapter 3 we solved same differential equations by NHPM. HPM and NHPM methods have been applied to three examples successfully and achieved approximate solutions. The basic idea described in this project is strong enough to be employed to solve other differential equations. The computations associated with the examples were performed using Mathematica 9.

DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify