On Generalized Coprime Graphs
نویسندگان
چکیده مقاله:
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
منابع مشابه
Coprime and Prime Labelings of Graphs
A coprime labeling of a simple graph of order n is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first n positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss c...
متن کاملEdge-decomposing graphs into coprime forests
The Barát-Thomassen conjecture, recently proved in [3], asserts that for every tree T , there is a constant cT such that every cT -edge connected graph G with number of edges (size) divisible by the size of T admits an edge partition into copies of T (a T -decomposition). In this paper, we investigate in which case the connectivity requirement can be dropped to a minimum degree condition. For i...
متن کاملOn the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملOn exponentially coprime integers
d|en d denote the number and the sum of exponential divisors of n, respectively. Properties of these functions were investigated by several authors, see [1], [2], [3], [5], [6], [8]. Two integers n,m > 1 have common exponential divisors iff they have the same prime factors and for n = ∏r i=1 p ai i , m = ∏r i=1 p bi i , ai, bi ≥ 1 (1 ≤ i ≤ r), the greatest common exponential divisor of n and m is
متن کاملNormalized Coprime Factorizations for Systems in Generalized State-Space Form
This note presents a state-space algorithm for the calculation of a normalized coprime factorization of continuous-time generalized dynamical systems. It will be shown that two Riccati equations have to be solved to obtain this normalized coprime factorization.
متن کاملGeneralized Schur Methods to Compute Coprime Factorizations of Rational Matrices
Numerically reliable state space algorithms are proposed for computing the following stable coprime factorizations of rational matrices factorizations with least order denominators factorizations with inner denominators and factorizations with proper stable factors The new algorithms are based on a recursive generalized Schur algorithm for pole assignment They are generally applicable regardles...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 9 شماره None
صفحات 1- 6
تاریخ انتشار 2014-11
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023