Your download is now in progress and you may close this window

Did you know that with a free Taylor & Francis Online account you can gain access to the following benefits?

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Have an account?
Login now Don't have an account?
Register for free

Login or register to access this feature

Have an account?
Login now Don't have an account?
Register for free

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Search in:

Advanced search

IETE Journal of Research Volume 28, 1982 - Issue 8

Submit an article Journal homepage

Views

CrossRef citations to date

Altmetric

Letters to the Editor

All Circuits of A Symmetric Graph

Samar Sen SarmaDepartment of Computer Science, University of Calcutta, 92, Acharya Prafulla Chandra Road, Calcutta700 009.

(Member) &

Atanu RakshitDepartment of Computer Science, University of Calcutta, 92, Acharya Prafulla Chandra Road, Calcutta700 009.

Page 429 | Received 28 Feb 1981, Published online: 10 Jul 2015

Cite this article
https://doi.org/10.1080/03772063.1982.11452771

References
Citations
Metrics
Reprints & Permissions

REFERENCES

Deo (N). Graph Theory with Application to Engineering and Computer Science. 1974. Prentice-Hall Inc., Englewood Cliffs, New Jersey.
Google Scholar
Reingold, Nievergelt & Deo. Combinatorial Algorithms: Theory and Practice. 1977. Prentice-Hall Inc., Englewood Cliffs, New Jersey.
Google Scholar
Char (J P), Connectivity Test for Circuit Detection. Electronic Letters. 14, 17; 1978; 566–567.
Web of Science ®Google Scholar
Gibbs (N E). A Cycle Generation Algorithm for Finite Undirected Linear Graphs. J.A.C.M. 16; 1969; 564–568.
Web of Science ®Google Scholar
Bapeswara Rao (V V) & Murthi (V G K). Enumeration of Circuits of a Graph. Proc. IEEE. 54, 1969; 700.
Google Scholar

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Share icon
Back to Top

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.

People also read
Recommended articles
Cited by

To cite this article:

Reference style: APA Chicago Harvard

Citation copied to clipboard

Reference styles above use APA (6th edition), Chicago (16th edition) & Harvard (10th edition)

Download citation

Download a citation file in RIS format that can be imported by citation management software including EndNote, ProCite, RefWorks and Reference Manager.

Choose format: RIS BibTex RefWorks Direct Export

Choose options: Citation Citation & abstract Citation & references