Edge Degree Weight of Sequential Join of Graphs
Article Sidebar
Published:
2013-09-30
Keywords:
Graph Theory, Edge degree weights
Main Article Content
Abstract
Let the weight w of an edge e= uv={u,v} of a graph G be defined by w(e)=deg(u)+deg(v)-2 and the weight of G be defined by w(G)= ∑ e ∈ E(G)w(e), where E(G) is the edge set of G. In this paper the weights of joins, sequential joins, unions, intersections, and products (Cartesian and Tensor) of sets of graphs are obtained. This leads to a variety of open questions and new studies.
Downloads
Download data is not yet available.
Article Details
Section
Science Journal of University of Zakho
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License [CC BY-NC-SA 4.0] that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work, with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online.
How to Cite
Sharaf, K. R., & Ali, D. A. (2013). Edge Degree Weight of Sequential Join of Graphs. Science Journal of University of Zakho, 1(2), 854-861. https://www.stest.uoz.edu.krd/index.php/sjuoz/article/view/431