On imbalances in multipartite multidigraphs

On imbalances in multipartite multidigraphs

A k-partite r-digraph(multipartite multidigraph) (or briefly MMD)(k ≥ 3, r ≥ 1) is the result of assigning a direction to each edge of a k-partite multigraph that is without loops and contains at most r edges between any pair of vertices from distinct parts. Let D(X1, X2, ⋯, Xk) be a k-partite r-dig...

Full description

Saved in:
Bibliographic Details
Main Authors: Samee, Uma Tul; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India (Author), Pirzada, Shariefuddin; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India (Author)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2018-04-03.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items