Edge Degree Weight of Sequential Join of Graphs
Keywords:
Graph Theory, Edge degree weightsAbstract
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.
References
F. Buckley and F. Harary; (1990), Distance in Graphs, Addison–Wesley, New York.
E.G. DuCasse, M.L. Gargano, M.B. Kattimani, and L.V. Quintas; (2009), The edge degree weight sum of a graph, Graph Theory Notes of New York,LVI:6, 38–43.
E.G.DuCasse and L.V.Quintas;(2011), Edge degree weight generalizations. Graph Theory Notes of New York, LXI:4, 25–30.
M.B. Kattimani; (2008), A note on edge degree weighted sums of a graph, Graph Theory Notes of New York, LV:3,25–26.
Downloads
Published
How to Cite
Issue
Section
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.