ScholarLens Back to search
2005•Journal of Discrete Mathematical Sciences and CryptographyRequires access

Graph equations for line graphs, blitact graphs and blict graphs

Bommanahal Basavanagoud, Veena Mathad

Open publisher page 2 citations

Abstract

In this paper, we solve the graph equations L(G)=B m (H), L(G) and . The equality symbol ‘=’ stands for an isomorphism between two graphs.

About this research paper

What this paper is about

In this paper, we solve the graph equations L(G)=B m (H), L(G) and . The equality symbol ‘=’ stands for an isomorphism between two graphs.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

In this paper, we solve the graph equations L(G)=B m (H), L(G) and . The equality symbol ‘=’ stands for an isomorphism between two graphs.

Key concepts: Graph isomorphism, Combinatorics, Mathematics, Line graph, Block graph, Chordal graph, Pathwidth, Discrete mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Graph equations for line graphs, blitact graphs and blict graphs — Research Paper | ScholarLens