M.Phil / MS
Permanent URI for this collectionhttps://repository.cuilahore.edu.pk/handle/123456789/52
This collection archives the complete set of theses produced by students of the COMSATS University Islamabad, Lahore Campus.
Browse
6 results
Search Results
Item Computational Invariants of Some Chemical Structures(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Abdur Rehman Hashmi; CIIT/FA19-RMT-004/LHR; Dr. Kashif Ali; LHR TP 7435In this study we will focus on computational invariants of different structures of chemical graphs. We will focus on the bond additive invariant, new bond additive invariant especially Mostar invariant, edge Mostar invariant and Total Mostar invariants of some graphs like Hydrogen Depleted molecular graph of Vulcanized Rubber and Poly-Methyl Methacrylate(PMMA).Item A Study of Topological Properties of Certain Chemical Structures(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Rizwan Saleem; CIIT/FA19-RMT-040/LHR; Dr.Hafiz Muhammad Afzal Siddiqui; LHR TP 7448This study examines the topological properties of selected chemical structures using tools from graph theory and mathematical chemistry. Chemical compounds are modeled as graphs in which atoms correspond to vertices and chemical bonds to edges. The research focuses on analyzing structural characteristics such as connectivity, degree distribution, and symmetry, along with the computation of important topological indices. These properties are used to gain insights into the stability, reactivity, and physicochemical behavior of the compounds. Comparative analysis of different chemical structures highlights the role of topology in predicting molecular properties and supporting the design of new materials.Item Metric Dimension Of Different Chemical Structures(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2019) Muhammad Umer Farooq; SP17-RMT-001; Dr. Muhammad Hussain; LHR TP 5431Item Metric Dimension Of Different Chemical Structures(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2018) Hafiz Muhammad Bilal; FA16-RMT-027; Dr. Muhammad Hussain; LHR TP 5191The Metric Dimension of a graph G is the minimum number of basis element in a resolving set. Let G = (V,E) be a connected graph and length of a shortest path between u and v is known as distance, denoted by d(u,v) in G. Let B = {b1,b2,...,bk} be an ordered set of vertices of G. The representation r(u|B) of u with respect to B is the k − tuple {d(u,b1),d(u,b2),d(u,b3),...,d(u,bk)}, where B is called a resolving set or locating set if every vertex of G is uniquely identified by its distances from the vertices of B or equivalently if distinct vertices of G have distinct representations with respect to B. A resolving set of minimum cardinality is called a basis for G and cardinality is the metric dimension of G is denoted by dim(G). In this thesis we investigated metric dimension of subdivided honeycomb network and Aztec diamond networkItem Topological Indices Based on Line Graph of Different Chemical and Non Chemical Structures(Library Information Services COMSATS University Lahore Campus, 2024-03-18) Sehrish Aslam; SP23-RMT-037; Prof. Dr. Muhammad Hussain; LHR TP 9572The utilization of graph theory has expanded considerably across various disciplines, with notable advancements in chemical graph theory. In recent years, researchers have explored numerous innovative avenues within this field. A chemical graph models a molecule by representing atoms as vertices and chemical bonds as edges. Analyzing topological indices, which are mathematical measures of a molecule’s structure, is crucial for understanding its physical and chemical properties. Firstly, we focused on degree-based topological indices, namely the Randic index, atom bond connectivity index, geometric arithmetic index, the first and the second Zagreb indices and co-indices, hyper Zagreb index, Hyper Zagreb index of Subdivision graph and Line graph of Niobium Dioxide NbO2.Item Metric Dimension on Line Graph of Different Chemical Structures(Library Information Services COMSATS University Lahore Campus, 2024-03-17) Zunaira Ijaz; FA22-RMT-028; Prof. Dr. Muhammad Hussain; LHR TP 9387The Metric Dimension of a graph G is the minimum number of basis element in a resolving set. Let G = (V,E) be a connected graph and length of a shortest path between u and v is known as distance, denoted by d(u, v) in G. Let B = b1,b2,...,bk be an ordered set of vertices of G. The representation r(u|B) of u with respect to B is the k tuple (d(u,b1),d(u,b2),d(u,b3),...,d(u,bk), where B is called a resolving set or locating set if every vertex of G is uniquely identified by its distances from the vertices of B or equivalently if distinct vertices of G have distinct representations with respect to B. A resolving set of minimum cardinality is called a basis for G and cardinality is the metric dimension of G is denoted by dim(G). We investigated metric dimension on Line Graph of Polythiophene Network, Backbone Network, Hex-derive Network and Chain Sillicate Networ