Department of Mathematics

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

Browse

Has files: YesSubject: search.filters.subject.Dr. Hani Shaker

Search Results

Now showing 1 - 10 of 15
  • No Thumbnail Available
    Item
    On Group Labeling of Antiprism Graphs
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Mazhar Hussain; CIIT/SP20-RMT-038/LHR; Dr. Hani Shaker; LHR TP 7640
    Assume a graph G with n vertices and Λ be any abelian group having n elements. Group distance magic labeling of G is a bijective map f: V → Λsuch that ∃μ∈Λ for that ∑ ∈ ( ) ( ) = ∀ v ∈ V, where are the vertices adjacent to v. In this thesis , we find the × × × , × × × , × × × , × × × , × × × , × × × , group distance magic labeling for antiprism graph !
  • No Thumbnail Available
    Item
    Metric Dimension of Honeycomb Rectangular Torus
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Sahar Ali; CIIT/SP20-RMT-028/LHR; Dr. Hani Shaker; LHR TP 7655
    Distance between two vertices of a graph is number of edges in a shortest path between them. One vertex having different distance from two distinct vertices is said to be a resolved vertex. Resolving set is a subset of vertex set of a graph and it consists of such vertices which resolve all the vertices of a graph. Metric dimension is an integer that is associated to resolving set and its defined as minimum count of resolving set. Honeycomb rectangular torus is one of the type of honeycomb torus. In this thesis, we will discuss metric dimension of honeycomb rectangular Torus. Metric dimension of honeycomb rectangular torus ( , ) for case (2, ) is 3. Metric dimension of honeycomb rectangular torus ( , ) > 4 for = 4 and is any even integer.
  • No Thumbnail Available
    Item
    On Spanning Simplicial Complexes Associated to Ladder Graph
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) MUHAMMAD AZIZ; CIIT/FA19-RMT-011/LHR; Dr. Hani Shaker; LHR TP 7427
    In this thesis, we are going to discuss the algebraic and combinatorial aspects of span- ning simplicial complex ∆s(G) associated with the simple connected graph G, namely Ladder graph Ln. We mainly emphasis the characterization of s(Ln), all spanning tree, of Ln. We intend to provide the algebraic and combinatorial characterization of SSC ∆s(Ln) associated with the ladder graph Ln. In particular, we compute the formula for the f -vector of the SSC associated with the ladder graph Ln.
  • No Thumbnail Available
    Item
    The Fundamental Groups and Classification of Covering Spaces
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Muhammad Shoaib Khan; CIIT/FA19-RMT-050/LHR; Dr. Hani Shaker; LHR TP 7439
    Algebraic topology is a very rich subject and its beauty lies in the way chosen to study space. Based on the global properties of spaces, the constructions and developments in this subject give an abstract and general notion. Defining algebraic topology as the study of topological spaces by using the algebraic invariants is the very basic interpretation of algebraic topology. However, the fundamental group is one of these topological invariants used to study topological spaces. The algebraic variants such as fundamental group are used for the classification of topological spaces up to the homeomorphism. However, most of the invariants classify topological spaces up to homotopy equivalence. The general idea of algebraic topology and fundamental group has been given in the 1st chapter. In this thesis work, to explain fundamental group, homeomorphism, and homotopy, the 2nd chapter includes the gathered ideas and concepts of homotopy of loops and maps, fundamental group, and induced homeomorphism. This chapter forms a basis for covering spaces which has a direct link with the fundamental group. After setting the basis for covering spaces, the 3rd chapter explains all the aspects related to covering spaces such as the lifting of maps to the covering space, and the applications of the fundamental group are explained through the major algebraic topology theorems; “Brouwer Fixed Point Theorem” and “Borsuk Ulam Theorem”. A main result named as “Van-Kampan Theorem” has also been proved which helps a lot to calculate the fundamental groups of different spaces. In chapter 4 all the possible covering spaces of the given topological space have been discussed leading to the classification of covering spaces. Moreover, this section discusses the classification of covering spaces by starting from “The Covering Transformation”, “Galois Covering Space”, “Universal Cover” and “Galois Correspondence”.
  • No Thumbnail Available
    Item
    Topological Indices of Boron Nano Tubes and Some Chemical Graphs
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) HAFIZ MUHAMMAD ASIF MEHMOOD; CIIT/FA19-RMT-114/LHR; Dr. Hani Shaker; LHR TP 7438
    The goal of this research study is to discuss some degree based topological descriptors of molecular graphs of (Boron Nano Tubes) by the assistance of fundamental ideas of graph theory. Using different terminologies we will calculate degree-based topological indices like “Gourava Indices”, “Shigehalli and Kanabur Indices”, “Sanskruti Index” of Boron Nano Tubes and also find some multiplicative version of above discussed topological indices of different molecular graphs.
  • No Thumbnail Available
    Item
    On Topological Study Of Face Cubic Lattice FCC(N)
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2021) Anum Shahzadi; FA19-RMT-062; Dr. Hani Shaker; LHR TP 7385
    This study explores the topological properties of the Face-Centered Cubic (FCC) lattice, denoted as FCC(N), which is widely used to model crystalline structures in solid-state physics and materials science. The research focuses on analyzing the structural arrangement, connectivity, and symmetry of the FCC lattice using concepts from graph theory and topology. Key properties such as vertex coordination, edge relationships, and lattice transformations are examined to understand how the topology influences physical characteristics like stability, density, and atomic interactions. The findings highlight the mathematical significance of FCC(N) and its applications in modeling complex three-dimensional networks.
  • No Thumbnail Available
    Item
    On Fermatean Fuzzy Bipolar Soft Topological Space
    (Library Information Services, CUI Lahore, 2023) Zainab Zaka; CIIT/FA21-RMT-056/LHR; Dr. Hani Shaker
    In the current thesis, on fermatean fuzzy bipolar soft topological space is investigated. A fermatean fuzzy set is converted by using bipolar soft set in topological space. The soft sets are a family of parameterized sets. The concepts of a soft neighborhood of a point, a soft open set, and a soft closed set are introduced. Soft topological space offers variety of topological spaces that are parameterized.The BSS is made with the two SS. One gives negative information while the other one gives us positive information. Two mappings are used to explain the FBSS. In FBS, one mapping is used to approximate fuzziness relative to the degree of positivity while another mapping is used to approximate fuzziness relative to the degree of negativity in the initial universal set objects. To cope with uncertainty in various real-world condition, a reducing mathematical technique called fermatean fuzzy set is being developed. FFS is more flexible than intuitionistic and PFS.The result are evaluated in on FFBSTS and FFBS. We work on some features such as neighborhood, continuity, and others.
  • No Thumbnail Available
    Item
    On Magic Type Labeling of Some Families of Subdivided Stars
    (Library Information Services COMSATS University Islamabad Lahore Campus, 2021) HINA BIBI; FA19-RMT-049; LHR TP 7415; Dr. Hani Shaker
    A graph G is simple means it is undirected,does not contain any multiple edges and loop. In a directed, the direction of edges are given. The graph is con- nected if all the edges and vertices are given. A graph is said to be loop when starting and ending vertex is same. If we assigns positive integers to the set of nodes(vertices) and set of lines(edges) by a mapping that is bijection then it is known as labeling. If we assigns positive integers to set of nodes(vertices) only then the labeling become vertex(node) labeling. If we assigns positive in- tegers to set of lines(edges) then the labeling is known as edge(line) labeling. If we label the vertex(nodes) set and edge(lines) set both the resulting labeling is known as total labeling. There are many types of labeling but in this we will discuss about the magic type labeling. The terms edge label, edge sum and edge weights will help us to label the graph. In research magic and anti-magic labeling is growing fast. We will introduce new results on the basis of a concept labeling that is SEMTL of the families of subdivided star.
  • No Thumbnail Available
    Item
    Metric Dimension of Wheel Based Graphs
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2024) Muzammal Ashraf; CIIT/SP21-BSM-037/LHR; Dr. Hani Shaker; LHR TP 9894
    The concept of metric dimension is essential for solving a variety of structural and opti- mization issues. The smallest size of a set of vertices that allows the original vertex to be uniquely determined by the shortest distances from any vertex to these selected vertices is known as the graph’s metric dimension. This idea finds use in the construction of effective routing algorithms, network navigation, and locating issues. In this study, we investigate the metric dimension of different classes of graphs, such as trees, pathways, cycles, and more intricate structures like grids and hypercubes. We explore methods for computing the metric dimension and present novel approaches to obtain accurate values or constraints for particular graph families. The study sheds light on the behavior of the metric dimen- sion under various graph settings, emphasizing how it varies with respect to graph factors including degree, vertex connectivity, and diameter. Furthermore, we examine the compu- tational difficulty of figuring out the metric dimension and suggest effective strategies for real-world uses. In order to provide more efficient solutions for graph-based problems in practical settings, we seek to optimize the determination of metric dimensions by utilizing recent developments in computational techniques.
  • No Thumbnail Available
    Item
    House Price Prediction by using Machine Learning
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2024) Laiba Faisal (CIIT/FA20-BSM-057/LHR), Ameema Umar (CIIT/FA20-BSM-053/LHR); Dr. Hani Shaker; LHR TP 9909
    The goal of this project is to create a machine learning model that can predict home selling prices by taking into account variables like location, square footage, number of bedrooms and bathrooms, and other relevant characteristics. The model prioritizes optimization for managing missing data in order to produce trustworthy estimates for the real estate market. This study advances real estate predictive modelling by using rigorous analysis and experimentation. It provides practitioners and stakeholders with useful information for making precise cost projections.