Skip to content
Research Article Open access CC BY 4.0

On Enumeration of Some Semigraphs

Prabhakar R. Hampiholi, Jotiba P. Kitturkar

Journal of Advances in Mathematics and Computer Science · pp. 1–14 · Published 3 Feb 2016

10.9734/BJMCS/2016/23440

Abstract

A semigraph G is vertex-labeled semigraph, if its n-vertices are labeled by distinct symbols. In this paper various results on enumeration of vertex-labeled semigraphs containing non-adjacent edges and number of vertex-labeled semigraphs with two adjacent s-edges are obtained. Also the number of vertex-labeled semigraphs on 1 to 8 vertices is calculated.

Vertex-labeled semigraph enumeration of vertex-labeled semigraphs.

Cited by 2

On Enumeration of Some Non-isomorphic Edge Complete Semigraphs

P. R. Hampiholi, Jotiba P. Kitturkar · Electron. Notes Discret. Math. · 2017

On Enumeration of some Non-Isomorphic Dendroids

P. R. Hampiholi, Jotiba P. Kitturkar · 2017

Article metrics

Real usage data collected on this platform.

5

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.