On degree product induced signed graphs of graphs

Aniyan, Achu; Naduvath, Sudev

doi:10.1063/5.0019097

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors considered the degree and eccentricity of vertices to sign a graph. Similarly, in the paper [2], an edge in a graph is signed considering the product of the degree of its end vertices.…”

Section: Introductionmentioning

confidence: 99%

Some new results on colour-induced signed graphs

Sudheer

George

Aniyan

et al. 2022

Acta Universitatis Sapientiae, Informatica

View full text Add to dashboard Cite

A signed graph is a graph in which positive or negative signs are assigned to its edges. We consider equitable colouring and Hamiltonian colouring to obtain induced signed graphs. An equitable colour-induced signed graph is a signed graph constructed from a given graph in which each edge uv receives a sign (−1)|c(v)−c(u)|,where c is an equitable colouring of vertex v. A Hamiltonian colour-induced signed graph is a signed graph obtained from a graph G in which for each edge e = uv, the signature function σ(uv)=(−1)|c(v)−c(u)|, gives a sign such that, |c(u)− c(v)| ≥ n − 1 − D(u, v) where c is a function that assigns a colour to each vertex satisfying the given condition. This paper discusses the properties and characteristics of signed graphs induced by the equitable and Hamiltonian colouring of graphs.

show abstract

Section: Introductionmentioning

confidence: 99%