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...
Saved in:
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: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On normalized Laplacian spectrum of zero divisor graphs of commutative ring ℤn
by: Pirzada, S.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India, et al.
Published: (2021) -
Bounds for graph energy in terms of vertex covering and clique numbers
by: Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India, et al.
Published: (2019) -
On size multipartite Ramsey numbers for stars versus paths and cycles
by: Lusiani, Anie; Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung Jalan Ganesa 10 Bandung, Indonesia, et al.
Published: (2017) -
The 4-girth-thickness of the complete multipartite graph
by: Rubio-Montiel, Christian; National Autonomous University of Mexico
Published: (2019) -
Automorphism groups of some families of bipartite graphs
by: Sreekumar, K.G.; Department of Mathematics University College, Kerala, India, et al.
Published: (2021)