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
Chat with our AI personalities
The divisor is the number your dividing by, for an example (345 divided 8), 8 is the divisor. For another example as (2348 divided by 56), 56 is the divisor.
is 2 divisor of 64
A divisor is the number in a division problem, that you are dividing by to get your answer.
A divisor is number that are divisabel by any number
Divisible is the other word for Divisor.