answersLogoWhite

0

Let S be a finite, non-empty set of positive integers. The divisor graph G(S) of S has S as its vertex set, and two distinct vertices i and j are adjacent if and only if either idivides j or j divides i. Let G be a simple graph. Then G is called a divisor graph if G is isomorphic to G(S) for some non-empty, finite set S of positive integers.

REFERENCE :

S. Ganesan, D. Uthayakumar, Corona of Bipartite Graphs with Divisor GRaphs Produce New Divosor Graphs,

Bulletin of Kerala Mathematics Association

Vol.9, No.1, (2012, June) 219-226

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach

Add your answer:

Earn +20 pts
Q: What is a divisor graph?
Write your answer...
Submit
Still have questions?
magnify glass
imp