Abstract
Realization of graphic sequences and finding the spanning tree of a graph are two popular problems of combinatorial optimization. A simple graph that realizes a given nonnegative integer sequence is often termed as a realization of the given sequence. In this paper, we have proposed a method for obtaining a spanning tree directly from a degree sequence by applying cycle detection algorithm, provided the degree sequence is graphic and nonregular. The proposed method is a two-step process. First, we apply an algorithm to check whether the input sequence is realizable through the construction of an adjacency matrix corresponding to the degree sequence. Then we apply the cycle detection algorithm separately to generate the spanning tree from it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kruskal JB. On the shortest spanning subtree of a graph and the travelling salesman problem. Proc Am Math Soc. 1956;7:48–50.
Prim RC. Shortest connection networks and some generalizations. Bell Syst Tech J. 1957;4:53–7.
Havel V. A remark on the existence of finite graphs. (Czech.) Casopis Pest Mat. 1955;80:477–80.
Hakimi SL. On the realizability of a set of integers as degrees of the vertices of a graph. SIAM J Appl Math. 1962;10:496–506.
Erdὅs P, Gallai T. Graphs with prescribed degree of vertices. (Hungarian) Math Lapok. 1960;11:264–74.
Ryser HJ. Combinatorial properties of matrices of zeros and ones. Can J Math. 1957;9:371–7.
Berge C. Graphs and hypergraphs. Amsterdam: North Holland and New York: American Elsevier; 1973.
Fulkerson DR, Hofman AJ, McAndrew MH. Some properties of graphs with multiple edges. Can J Math. 1965;17:166–77.
Bollobảs B. Extremal graph theory. New York: Acedemic Press; 1978.
Grá½”nbaum B. Graphs and complexes. Report of the university of Washington, Seattle, Math. 572B, (1969) (private communication).
Hässelbarth W. Die Verzweighteit von Graphen. Match. 1984;16:3–17.
Sierksma G, Hoogeveen H. Seven criteria for integer sequences being graphic. J Graph Theory. 1991;15(2):223–31.
Kleitman DJ, Wang DL. Algorithms for constructing graphs and digraphs with given valences and factors. Discrete Math. 1973;6:79–88.
Czajkowski, Eggleton RB. Graphic sequences and graphic polynomials: a report. Infinite Finite Sets. 1973;1:385–92.
Tripathi A, Vijay S. A note on theorem on Erdὅs and Gallai. Discrete Math. 2003;265:417–20.
Dahl G, Flatberg T. A remark concerning graphical sequences. Discrete Math. 2005;304:62–4.
Tripathi A, Taygi H. A simple criterion on degree sequences of graphs. Discrete Appl Math. 2008;156:3513–7.
Boukerche A, Tropper C. A distributed graph algorithm for the detection of local cycles and knots. IEEE Trans Parallel Distrib Syst. 1998;9:748–57.
Manivannan D, Singhal M. An efficient distributed algorithm for detection of knots and cycles in a distributed graph. IEEE Trans Parallel Distrib Syst. 2003;14:961–72.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Biswas, P., Shabnam, S., Paul, A., Bhattacharya, P. (2016). A Cycle Detection-Based Efficient Approach for Constructing Spanning Trees Directly from Nonregular Graphic Sequences. In: Dash, S., Bhaskar, M., Panigrahi, B., Das, S. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 394. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2656-7_10
Download citation
DOI: https://doi.org/10.1007/978-81-322-2656-7_10
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2654-3
Online ISBN: 978-81-322-2656-7
eBook Packages: EngineeringEngineering (R0)