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
3 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 Resolving Topological Index Of Graphs Associated(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Ali Bahadar; FA19-RMT-109; Dr. Kashif Ali; LHR TP 7394In this thesis, we study a well-known concept of graph theory, called resolvability, in con- text of two types of graphs ( commuting and non-commuting) associated to two algebraic structures (dihedral and semi-dihedral groups). By analyzing the resolving share and the average resolving share of each vertex, we compute the resolving topological index of each graph.Item H-Irregular Total Labeling Of Connected Graphs(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Muhammad Kaleem; FA19-RMT-028; Dr. Kashif Ali; LHR TP 7390A labelling α is a vertex H irregular k-labelling of graph in which we assign the value from {1, 2, 3, · · · , k} to the vertices for this the weight of Hi and Hj is different for i 6= j. The vertex weight of any H can be calculated by adding the labels of the vertices which are includes in H. A labelling α is edge H irregular k-labelling α of graph in which we assign the value from {1, 2, 3, · · · , k} to the edges for this the weight of Hi and Hj is different for i 6= j. The weight of any H can be calculated by adding the labels of edges which are includes in H. In this thesis we find the vertex and edge H irregular k-labellings of Starphene graph, ladder graph, triangular ladder graph and double gear graph. Key words: The vertex and edge H irregular k-labellings starphene graph and gear graph.