ScholarLens Back to search
2010•Zenodo (CERN European Organization for Nuclear Research)Open access

Smarandachely T-Path Step Signed Graphs

Siva Kota Reddy, V. Lokesha, B. Prashanth

Open full text 0 citations

Abstract

Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed graphs.

Open-access reader

About this research paper

What this paper is about

Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed graphs.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed graphs.

Key concepts: Path (computing), Combinatorics, Mathematics, Computer science, Computer network

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Smarandachely T-Path Step Signed Graphs — Research Paper | ScholarLens