Computing the edge irregularity strengths of chain graphs and the join of two graphs

Computing the edge irregularity strengths of chain graphs and the join of two graphs

In computer science, graphs are used in variety of applications directly or indirectly. Especially quantitative labeled graphs have played a vital role in computational linguistics, decision making software tools, coding theory and path determination in networks. For a graph G(V, E) with the vertex...

Full description

Saved in:
Bibliographic Details
Main Authors: Ahmad, Ali; College of Computer Science & Information Systems, Jazan University, Jazan, Saudi Arabia (Author), Gupta, Ashok; College of Computer Science & Information Systems, Jazan University, Jazan, Saudi Arabia (Author), Simanjuntak, Rinovia; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jl. Ganesa 10 Bandung 40132, Indonesia (Author)
Other Authors: We thank the Deanship of Research, Jazan University for supporting this project under the Grant No. 000114/7/37 (Contributor)
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