Browsing by Author "Dr. Sarfarz Ahmad"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    On Some Combinatorial Properties Of Graphs, Posets
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2019) Muhammad Arfan Ali; FA12-PMATH-002; Dr. Sarfarz Ahmad; LHR TP 5945
    This work investigates fundamental combinatorial properties of graphs and partially ordered sets (posets), focusing on structural relationships, ordering principles, and enumeration techniques. Concepts from Graph Theory and Order Theory are used to analyze connectivity, comparability, chains, antichains, and lattice structures. The study highlights how these discrete frameworks can be applied to solve problems in optimization, data organization, and theoretical computer science. Emphasis is placed on key invariants and combinatorial methods that reveal deeper insights into the organization and behavior of discrete systems.
  • No Thumbnail Available
    Item
    Randic, Seidel And Laplacian Energy Of NEPS Graphs
    (Library Information Services, COMSATS University Islamabad, Lahore Campus, 2019) Yasir Ali; FA17-RMT-007; Dr. Sarfarz Ahmad; LHR TP 5645
    Let be the simple graph, then we can obtained the energy of a graph by taking the absolute sum of the eigenvalues of the adjacency matrix of . In this research we have computed different energy invariants of the Non-completed Extended P-Sum (NEPS) of graph . In particular we investigate the Randic, Seidel and Laplacian energies of the NEPS of path graph with any base . Here denotes number of vertices and denotes the number of copies of path graph . Our some of the results depend on the number of zeroes in base elements, for which we use the notation .