Skip to the main content

Short communication, Note

https://doi.org/10.5562/cca3811

On Marginal Entropy of Graphs

Bünyamin Şahin orcid id orcid.org/0000-0003-1094-5481 ; Department of Mathematics, Faculty of Science, Selçuk University, Konya, Turkey


Full text: english pdf 1.201 Kb

page 129-132

downloads: 626

cite


Abstract

Marginal entropy is one of the distances based on the graph entropy. Then, this entropy is computed by the Wiener index of graphs. In this paper, we obtain the marginal entropy of paths, stars, double stars, cycles and vertex-transitive graphs.

Keywords

graph entropy; distance; marginal entropy

Hrčak ID:

267330

URI

https://hrcak.srce.hr/267330

Publication date:

16.12.2021.

Visits: 1.574 *