5 papers
Edge Contraction and Line Graphs
Hany Ibrahim, Peter Tittmann
Given a family of graphs , a graph is -free if any subset of does not induce a subgraph of that is isomorphic to any graph in …
Edge Contraction and Forbidden Induced Graphs
Hany Ibrahim, Peter Tittmann
A graph is -free if any subset of does not induce a subgraph of that is isomorphic to . Given a graph , we present sufficient and necessary conditions for a…
Characterizations for split graphs and unbalanced split graphs
Hany Ibrahim
We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any (, claw)-free graph with is a split graph. Also,…
Note on clique polynomials and independent set polynomial of graphs
Hany Ibrahim
In 1994, Cornelis Hoede and Xueliang Li introduced the clique polynomial of a graph. Also, a theorem for the edge subgraph expansion for clique polynomials. In this note we present…
Defensive alliance polynomial
Hany Ibrahim
We introduce a new bivariate polynomial which we call the defensive alliance polynomial and denote it by da(G; x, y). It is a generalization of the alliance polynomial [Carballosa…