3 citations · 8 across the 13 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2025
Enumeration of Tree-like Multigraphs with a Given Number of Vertices, Self-loops and Multiple Edges
Naveed Ahmed Azam, Seemab Hayat
Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph t…
cs.DM2025
Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges
Muhammad Ilyas, Seemab Hayat, Naveed Ahmed Azam
The enumeration of chemical graphs is an important topic in cheminformatics and bioinformatics, particularly in the discovery of novel drugs. These graphs are typically either tree…
cs.DM2024
A Method to Generate Multi-interval Pairwise Compatibility Graphs
Seemab Hayat, Naveed Ahmed Azam
Reconstruction of evolutionary relationships between species is an important topic in the field of computational biology. Pairwise compatibility graphs (PCGs) are used to model suc…