Unicyclic nonintegral sum graphs
A graph G = (V,E) is an integral sum graph if there exists a labeling S(G) ⊂ Z such that V = S(G) and every two distinct vertices u, υ ∈ V are adjacent if and only if u + υ ∈ V. A connected graph G = (V,E) is called unicyclic if |V| = |E|. In this paper two infinite series are constructed of unicyclic graphs that are not integral sum graphs.
KeywordsIndustrial Mathematic Connected Graph Discrete Math Edge Incident Distinct Vertex
Unable to display preview. Download preview PDF.