Counting and enumerating unlabeled split–indifference graphs-Reference-Cited by-同舟云学术

Counting and enumerating unlabeled split–indifference graphs

Published:2017-08 Issue:04 Volume:09 Page:1750055
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Markenzon Lilian¹,Waga Christina F. E. M.²^ORCID

Affiliation:

1. NCE – Universidade Federal do Rio de Janeiro, Av. Athos da Silveira, 274, Predio do CCMN, Cidade Universitaria, 21941-611, Rio de Janeiro, Brazil

2. IME – Universidade do Estado do Rio de Janeiro, Rua São Francisco Xavier 524, 20559-900, Rio de Janeiro, Brazil

Abstract

We present in this paper a code for the class of unlabeled split–indifference graphs. This codification allows us to establish the exact number of elements of the class up to isomorphism. In order to obtain this result, structural properties of the class are explored, including a new approach for the characterization theorem.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830917500550

Reference18 articles.

1. An Introduction to Chordal Graphs and Clique Trees

2. The total chromatic number of split-indifference graphs

3. A coding algorithm for Rényi trees

4. Annals of Discrete Mathematics;Golumbic M. C.,2004

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Vector Domination in split-indifference graphs;Information Processing Letters;2020-03

2. Block-indifference graphs: Characterization, structural and spectral properties;Discrete Applied Mathematics;2019-09