Counting independent sets in tricyclic graphs

Let G be a graph of order n in the class of tricyclic graphs. In this paper, we propose an algorithm to compute the number of independent sets of G in O(n) time.

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 331; pp. 138 - 146
Main Author:	Poureidi, Abolfazl
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.05.2023
Subjects:	Counting Independent set Linear-time algorithm Tricyclic graph Independent set Tricyclic graph Counting Linear-time algorithm
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!