On characterization of connected graphs without induced subgraphs 3-paws

الملخص EN

For the vertices a of the graph G , G a( ) denoted the subgraph on the set of all vertices adjeceent with a will be write as [ ] a this subgraph is called a neighborhood of the vertex a in the graph G .

In this work we investigates several properties of these connected graphs without induced subgraphs 3 -paws