On independent domination parameters of some special families of Halin graph

D. Anandhababu1 Department of Mathematics, SRM Institute of Science and Technology, Kattangulathur603203, Tamil Nadu, India, E-mail: [email protected]

M. Priyadharshini2 Department of Mathematics, SRM Institute of Science and Technology, Kattangulathur603203, Tamil Nadu, India, E-mail: [email protected]

N. Parvathi3 Department of Mathematics, SRM Institute of Science and Technology, Kattangulathur603203, Tamil Nadu, IndiaCorrespondence[email protected]

Abstract

A Halin graph H is a planar and three connected graph. The Halin graph is constructed by joining all pendent vertices of tree into cycle. In this article we constructed some special families of Halin graphs and determined the independent domination number of those graphs.

Subject Classification:

Keywords:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

On independent domination parameters of some special families of Halin graph

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

On independent domination parameters of some special families of Halin graph

Abstract

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date