Department of Mathematics

Permanent URI for this communityhttps://repository.cuilahore.edu.pk/handle/123456789/21

Browse

Author: search.filters.author.Dr. Muhammad HussainSubject: search.filters.subject.Department of Mathematics

Search Results

Now showing 1 - 10 of 10
  • No Thumbnail Available
    Item
    Topological Indices Based on Line Graph of Different Chemical and Non-Chemical Structures
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Alizeh Muhammad; CIIT/SP20-RMT-017/LHR; Dr. Muhammad Hussain; LHR TP 9572
    Chemical compounds have variety of physicochemical, toxicological and pharmaco- logical properties which predict their nature and how they will react. But the study of these properties requires Herculean and laborious experimentation so its alternative, topological indices were invented about 150 years ago which is the greatest break- through in the field of mathematical chemistry. It provides the substitute to scrutinize the behavior of chemical graphs and an easy approach for substantiating their existing numerous properties and thus helps in designing novel drugs and compounds. This was achieved due to the birth of chemical graph theory in which modeling of chemical compounds can be done. In this research, miscellaneous mathematical and computational techniques are applied for the calculation of several degree-based and spectrum-based topological invariants for boric acid (H3BO3) layer structure’s derivatives (subdivision, line graph and caged chain). The molecular descriptors being computed are the harmonic index; two ver- sions of Randic´, sum-connectivity, atom-bond connectivity, geometric-arithmetic and Zagreb indices. Besides these, the list also includes Estrada index, energy and the distance energy of above-named graphs. Pre-invented formulae are used for their cal- culation and for spectrum-based invariants, polynomials are generated and vindicated based on results.
  • No Thumbnail Available
    Item
    Radio Labeling of Different Graphs
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) AMNA RIAZ; CIIT/FA19-RMT-057/LHR; Dr. Muhammad Hussain; LHR TP 7406
    This thesis is about Radio Labeling. For a graph G, any two vertices, v1 and v2 in G, Let d(v1, v2) represent the distance between v1 and v2. Let diameter of G is diam(G). A Multi-level distance labeling(radio labeling) for G is a function f that assign to each vertex so that they can satisfy this condition d(v1, v2) + |f(v1) − f(v2)| ≥ diam(G) + 1 The main purpose for this research is to find the radio number of Web graph rn(Wn), embedded graph rn(Emn) and radio number of double wheel graph rn(DWn). we use basic concept to find their radio numbers.
  • No Thumbnail Available
    Item
    Valuations and Metric Dimensions on Graphs
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2017) Shahid Imran; CIIT/FA12-PMATH-003/LHR; Dr. Muhammad Hussain; LHR TP 5284
    Labeling of graph is a beautiful and rich technique of Mathematics. It has extensive usage in applications such as data transmission, x-ray, circuit design, astronomy, communication links and coding theory. Labeling of graph is defined as a correspondence from the set {1,2,3,, v  e  f } to the vertices, edges and faces of a plane graph G in such a way that each vertex, edge and face receives exactly one label and each number is used exactly once as a label. The weight of a face under a labeling of type (1,1,1) is the sum of labels carried by that face and all the edges and vertices surrounding it. A labeling of type (1,1,1) of a plane graph G is called d-antimagic if for every positive integer s the set of weights of all s-sided faces is {a, a  d, a  2d,, a  ( f 1) d } for some integer a and d 0 , where f is the number of s-sided faces. In particular when d  0 then the d- antimagic labeling of type (1,1,1) is called magic labeling of type (1,1,1) . Moreover, if the vertices are labeled by the smallest possible number. It is known as super magic and anti- magic accordingly. Furthermore, let G be a connected graph and d (x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W. A metric dimension of G is the minimum cardinality of a resolving set of G and is denoted by dim(G). This dissertation studies about the construction of super face anti-magic labeling of type (1,1,1) for disjoint union of toroidal fullerenes, magic and anti-magic labeling of type (1,1,1) for union of generalized friendship graphs. Metric dimension of Jahangir related graphs, generalized prism related graphs and graphs obtained by rooted product has been also calculated.
  • No Thumbnail Available
    Item
    Irregularities, Energies and Pattern of Bridge Chain Graph Network
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Faisal Javed; SP19-RMT-036; LHR TP 7348; Dr. Muhammad Hussain
    The graph ? consists of some vertex ?(?) are connected by ?(?) where the position of vertices does not matter. The degree of a graph vertex is basically a number of incident edges ?(?) and vertex ? can be denoted by du. The upper and lower bound of graph energy with minimal and maximal energy is abroad field of Spectral Graph theory. The energy of Graph ?(?) in term of vertices and number of edges in graph ? is involved in absolute value of eigenvalue adjacency matrix of G where λ is the spectral radius. The Graph has energy equal to ?(?) = ∑ |? ? ?=1 |. An irregular graph G is totally defined as ??𝑡(?) = |𝑢 − 𝑣|. Finally, we determine the energy, pattern and irregularities of chain like cyclic graph. Our exploring outputs will rely upon Size and Order of Graph, Degree of Graph, Irregular Graph, Multi Graph, Cyclic Graph, Wheel Graph, Bridge Graph, Prism Graph, Connected and Planarity Graph, and Concept of Distance and Degree in Graph.
  • No Thumbnail Available
    Item
    Graph Energies of Generalized Chain on Wheel Like Graphs
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2022) Muhammad Shahzad Khalid; FA20-RMT-016; LHR TP 7920; Dr. Muhammad Hussain
    The energy of a graph G is the absolute sum of all eigen-values of its adjacency matrix A(G). Eigen-values are used to calculate the limit of how much data may be sent via a communication channel such as a phone line or the air. Moreover energy which are the absolute sum of all eigen-value are also use in various field's especially in computer networking to transmit data. Here we calculate and generalize graph energy of different families of graph.
  • No Thumbnail Available
    Item
    FACE ANTI-MAGIC LABELINGS AND DEFICIENCY OF GRAPHS
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2016) Ali Tabraiz; FA12-PMATH-001; LHR TP 4824; Dr. Muhammad Hussain
    Labeling of graph is a beautiful and rich technique of Mathematics. It has extensive usage in applications such as data transmission, x-ray, circuit design, astronomy, communication links and coding theory. A labeling of a graph is a mapping that carries some set of graph elements into (usually positive integers). An ) , ( d a face anti-magic total labeling of a graph, with p vertices, q edges and f faces, is a one-to-one mapping that takes the vertices, edges and faces into }, , , 2 , 1 { f q p such that the sums of the label on the edges, vertices and faces form an arithmetic progression starting at a and having difference . d An edge magic total labeling of a graph G is a one-to-one mapping from ) ( ) ( G E G V onto the integers }, , , 2 , 1 { q p with the property that there is an integer constant k such that k y xy x ) ( ) ( ) ( for any ). (G E y x Furthermore, the edge-magic deficiency of a graph , G ) (G is defined as the minimum non-negative integer n such that 1 K n G is edge-magic.
  • No Thumbnail Available
    Item
    On Anti-Magic Total Labeling
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2020) Aisha Asghar; SP18-RMT-020; LHR TP 6546; Dr. Muhammad Hussain
    Graph labeling plays a very significant function in implementations in graph theory such as network, correspondence naming, X-ray, circuit modeling, crystallography, radar, rocket navigation, astronomy and data base administration. A labeling is bijective mapping, in which vertices or edges are assigned to natural numbers. If the weights of all vertices are identical, then these labels are considered magic labeling. In 2000, Baca et al.[5] presented the idea of total antimagic labelling of (a, d)-vertex. A labeling in which both vertices and edges compose of domain collection is called total labeling. If we assign the smallest number to vertices and then to edges, a labeling is called super (a, d)-vertex total antimagic labelling. Hussain et. Al. [17,18] formulated (a,d)-vertex antimagic total labeling on Harary graghs, however, many cases are still open. This dissertation learning about the configuration of new results of (a,d)-vertex anti-supermagic total (VAST) labeling of Harary graphs. Also we construct same new esults of super (a,d)-vertex magic total(SVT) labeling on Harary graphs.
  • No Thumbnail Available
    Item
    Local Fractional Metric Dimension of Different Chemical Structures
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2020) MUHAMMAD ZULQARNAIN; FA18-RMT-078; LHR TP 7012; Dr. Muhammad Hussain
    In this thesis we find out different chemical structures and then convert them into planar network graphs. Consequently, to calculate the local fractional metric dimension of these network graphs. We are also interested to extend the proposal to the rooted product of different families of graphs. We also find local metric dimension and local fractional metric dimension on the line graph of subdivided honeycomb network.
  • No Thumbnail Available
    Item
    Anti-Magic Labeling on Harary Graph and Subdivided Caterpiller
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2016) Muhammad Mubashar; FA14-RMT-029; LHR TP 6839; Dr. Muhammad Hussain
    Graphs play an important and vital role in Mathematics. Graph labeling creates new ideas graph theory. Can labeling be helped us to solve problems in Mathematics and other fields? The answer of this question increases the deep value of Graph Labeling. A magic labeling of a graph is described by Kotzig and Rosa [22] in 1970 as an important iniative. A graph labeling (or valuation) is a unique way that gives the labels to graph elements (commonly, these are non negative or positive integers). if we consider the domain set of all vertices and edges; such labelings are called total labelings. Sometime we use labelings for vertex set or the edge set alone and these labelings would be called as vertex-labeling and edge-labeling respectively. Many other domains are also possible. There are some famous labelings like as harmonious, cordial, graceful and antimagic. In 2000, Baˇca et al. [2] discussed a (a,d)-vertex-antimagic total labeling. A (a,d) vertex-antimagic total labeling is called super (a,d)-vertex-antimagic total labeling, when we give smallest labels to the vertices. An (a,d)-edge-antimagic total labeling was defined by Simanjuntak et al. [41]. An (a,d)-edge-antimagic total labeling is called a super (a,d)-edge-antimagic total labeling, when we give the least labels to the vertices. A graph G, which is made up of cycles with chords is known as Harary Graph. A brief discussion exposed important results on super (a,d)-edge-antimagic total labeling Harary graph by M. Baˇca and M. Murugan [1, 6]. This work is designed for the construction of (a,d)-vertex-antimagic total labeling of Harary graph as well as for super (a,d)-vertex antimagic total labeling of Harary graph for the different value of d.
  • No Thumbnail Available
    Item
    Fractional Metric Dimension Of Different Chemical
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2020) Ahmad Kaleem; FA18-RMT-052; LHR TP 6458; Dr. Muhammad Hussain