Publication:
Independence number of graphs and line graphs of trees by means of omega invariant

No Thumbnail Available

Date

2020-02-26

Authors

Ozden, Hacer
ÖZDEN AYNA, HACER
Zihni, Fikriye Ersoy
Erdogan, Fatma Ozen
Cangul, Ismail Naci

Authors

Srivastava, Gautam
Srivastava, Hari Mohan

Journal Title

Journal ISSN

Volume Title

Publisher

Springer

Research Projects

Organizational Units

Journal Issue

Abstract

A recently defined graph invariant denoted by O(G) for a graph G is shown to have several applications in graph theory. This number gives direct information on the realizability, number of realizations, connectedness, cyclicness, number of components, chords, loops, pendant edges, faces, bridges, etc. In this paper, we use O to give a characterization of connected unicyclic graphs, to calculate the omega invariant and to formalize the number of faces of the line graph of a tree, and give a new algorithm to formalize the independence number of graphs G and line graphs L(G) by means of the support vertices, pendant vertices and isolated vertices in G.

Description

Keywords

Realizability, Sequences, Criteria, Graph theory, Line graphs, Independence number, Omega invariant, Degree sequence, Science & technology, Physical sciences, Mathematics, Multidisciplinary sciences, Mathematics, Science & technology - other topics

Citation

1

Views

0

Downloads

Search on Google Scholar