scholarly journals Symmetric Graphs with Respect to Graph Entropy

10.37236/5642 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Seyed Saeed Changiz Rezaei ◽  
Ehsan Chiniforooshan
Keyword(s):  
Probability Distribution ◽  
Chromatic Number ◽  
Probability Distributions ◽  
Independence Number ◽  
Maximum Size ◽  
Independent Sets ◽  
Fractional Chromatic Number ◽  
Vertex Set ◽  
Definition Of ◽  
The Relationship

Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is symmetric with respect to $F_G(P)$ if the uniform distribution on $V(G)$ maximizes $F_G(P)$. Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic number, we characterize all graphs which are symmetric with respect to graph entropy. We show that a graph is symmetric with respect to graph entropy if and only if its vertex set can be uniformly covered by its maximum size independent sets. This is also equivalent to saying that the fractional chromatic number of $G$, $\chi_f(G)$, is equal to $\frac{n}{\alpha(G)}$, where $n = |V(G)|$ and $\alpha(G)$ is the independence number of $G$. Furthermore, given any strictly positive probability distribution $P$ on the vertex set of a graph $G$, we show that $P$ is a maximizer of the entropy of graph $G$ if and only if its vertex set can be uniformly covered by its maximum weighted independent sets. We also show that the problem of deciding if a graph is symmetric with respect to graph entropy, where the weight of the vertices is given by probability distribution $P$, is co-NP-hard.

scholarly journals The Non-Crossing Graph

10.37236/1140 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Nathan Linial ◽  
Michael Saks ◽  
David Statter
Keyword(s):  
Chromatic Number ◽  
Independence Number ◽  
Clique Number ◽  
The Other ◽  
Fractional Chromatic Number ◽  
Vertex Set

Two sets are non-crossing if they are disjoint or one contains the other. The non-crossing graph ${\rm NC}_n$ is the graph whose vertex set is the set of nonempty subsets of $[n]=\{1,\ldots,n\}$ with an edge between any two non-crossing sets. Various facts, some new and some already known, concerning the chromatic number, fractional chromatic number, independence number, clique number and clique cover number of this graph are presented. For the chromatic number of this graph we show: $$ n(\log_e n -\Theta(1)) \le \chi({\rm NC}_n) \le n (\lceil\log_2 n\rceil-1). $$

scholarly journals On Some Conjectures Concerning Critical Independent Sets of a Graph

10.37236/5580 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Taylor Short
Keyword(s):  
Lower Bound ◽  
Independence Number ◽  
Independent Set ◽  
Maximum Size ◽  
Independent Sets ◽  
Simple Graph ◽  
Vertex Set ◽  
The Difference

Let $G$ be a simple graph with vertex set $V(G)$. A set $S\subseteq V(G)$ is independent if no two vertices from $S$ are adjacent. For $X\subseteq V(G)$, the difference of $X$ is $d(X) = |X|-|N(X)|$ and an independent set $A$ is critical if $d(A) = \max \{d(X): X\subseteq V(G) \text{ is an independent set}\}$ (possibly $A=\emptyset$). Let $\text{nucleus}(G)$ and $\text{diadem}(G)$ be the intersection and union, respectively, of all maximum size critical independent sets in $G$. In this paper, we will give two new characterizations of Konig-Egervary graphs involving $\text{nucleus}(G)$ and $\text{diadem}(G)$. We also prove a related lower bound for the independence number of a graph. This work answers several conjectures posed by Jarden, Levit, and Mandrescu.

The Weakly Nilpotent Graph of a Commutative Ring

2017 ◽  
Vol 60 (2) ◽  
pp. 319-328
Author(s):  
Soheila Khojasteh ◽  
Mohammad Javad Nikmehr
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Disjoint Union ◽  
Independence Number ◽  
Artinian Ring ◽  
Clique Number ◽  
Commutative Rings ◽  
Unicyclic Graph ◽  
Nilpotent Elements ◽  
Vertex Set

AbstractLet R be a commutative ring with non-zero identity. In this paper, we introduce theweakly nilpotent graph of a commutative ring. The weakly nilpotent graph of R denoted by Γw(R) is a graph with the vertex set R* and two vertices x and y are adjacent if and only if x y ∊ N(R)*, where R* = R \ {0} and N(R)* is the set of all non-zero nilpotent elements of R. In this article, we determine the diameter of weakly nilpotent graph of an Artinian ring. We prove that if Γw(R) is a forest, then Γw(R) is a union of a star and some isolated vertices. We study the clique number, the chromatic number, and the independence number of Γw(R). Among other results, we show that for an Artinian ring R, Γw(R) is not a disjoint union of cycles or a unicyclic graph. For Artinan rings, we determine diam . Finally, we characterize all commutative rings R for which is a cycle, where is the complement of the weakly nilpotent graph of R.

THE JACOBSON GRAPH OF COMMUTATIVE RINGS

2012 ◽  
Vol 12 (03) ◽  
pp. 1250179 ◽  
Author(s):  
A. AZIMI ◽  
A. ERFANIAN ◽  
M. FARROKHI D. G.
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Independence Number ◽  
Commutative Rings ◽  
Dominating Number ◽  
Jacobson Graph ◽  
Vertex Set ◽  
Numerical Invariants ◽  
Nonzero Identity

Let R be a commutative ring with nonzero identity. Then the Jacobson graph of R, denoted by 𝔍R, is defined as a graph with vertex set R\J(R) such that two distinct vertices x and y are adjacent if and only if 1 - xy is not a unit of R. We obtain some graph theoretical properties of 𝔍R including its connectivity, planarity and perfectness and we compute some of its numerical invariants, namely diameter, girth, dominating number, independence number and vertex chromatic number and give an estimate for its edge chromatic number.

scholarly journals Mobius Function Graph Mn(G)

2019 ◽  
Vol 8 (10) ◽  
pp. 1481-1484
Keyword(s):  
Positive Integer ◽  
Structural Properties ◽  
Chromatic Number ◽  
Perfect Matching ◽  
Independence Number ◽  
Möbius Function ◽  
Proper Coloring ◽  
Mobius Function ◽  
Function Graph ◽  
Vertex Set

The study of graphs on positive integer n as its vertex set from 1 to n, the adjacency of vertices defined using tools of number theoretic functions is interesting and may focus new light on structure of the integers. This paper is concerned on some of the structural properties of the Möbius function graphs from the number theoretic Möbius function. Further we have discussed some basic observations, results concerning |E|, subgraph, perfect matching, completeness, independence number and chromatic number of Möbius function graphs along with new induced proper coloring method.

scholarly journals Distributions on the circle group

2019 ◽  
Vol 24 (3) ◽  
pp. 433-446
Author(s):  
Simona Staskevičiūtė
Keyword(s):  
Probability Distribution ◽  
Unit Circle ◽  
Probability Distributions ◽  
Circle Group ◽  
Definition Of ◽  
Random Angle

In this paper, we extend the definition of a random angle and the definition of a probability distribution of a random angle. We expand P. Lévy’s researches related to wrapping the probability distributions defined on R. We determine a relation between quasi-lattice probability distributions on R and lattice probability distributions on the unit circle S. We use the Bergström identity for comparison of a convolution of probability distributions of random angles. We also prove an inverse formula for lattice probability distributions on S.

scholarly journals Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number

2002 ◽  
Vol 11 (4) ◽  
pp. 323-341 ◽  
Author(s):  
COLIN COOPER ◽  
ALAN FRIEZE ◽  
BRUCE REED ◽  
OLIVER RIORDAN
Keyword(s):  
Chromatic Number ◽  
Independence Number ◽  
Regular Graphs ◽  
Constant Degree ◽  
Small Constant ◽  
Vertex Set

Let r = r(n) → ∞ with 3 [les ] r [les ] n1−η for an arbitrarily small constant η > 0, and let Gr denote a graph chosen uniformly at random from the set of r-regular graphs with vertex set {1, 2, …, n}. We prove that, with probability tending to 1 as n → ∞, Gr has the following properties: the independence number of Gr is asymptotically 2n log r/r and the chromatic number of Gr is asymptotically r/2nlogr.

scholarly journals Estimating the fractional chromatic number of a graph

2021 ◽  
Vol 13 (1) ◽  
pp. 122-133
Author(s):  
Sándor Szabó
Keyword(s):  
Chromatic Number ◽  
Numerical Experiments ◽  
Independent Sets ◽  
Linear Program ◽  
Fractional Chromatic Number ◽  
Upper Estimate ◽  
The Given

Abstract The fractional chromatic number of a graph is defined as the optimum of a rather unwieldy linear program. (Setting up the program requires generating all independent sets of the given graph.) Using combinatorial arguments we construct a more manageable linear program whose optimum value provides an upper estimate for the fractional chromatic number. In order to assess the feasibility of the proposal and in order to check the accuracy of the estimates we carry out numerical experiments.

scholarly journals Some Properties of Unitary Cayley Graphs

10.37236/963 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Walter Klotz ◽  
Torsten Sander
Keyword(s):  
Cayley Graph ◽  
Chromatic Number ◽  
Cayley Graphs ◽  
Independence Number ◽  
Clique Number ◽  
Vertex Connectivity ◽  
Euler Function ◽  
Vertex Set ◽  
Unitary Cayley Graph

The unitary Cayley graph $X_n$ has vertex set $Z_n=\{0,1, \ldots ,n-1\}$. Vertices $a, b$ are adjacent, if gcd$(a-b,n)=1$. For $X_n$ the chromatic number, the clique number, the independence number, the diameter and the vertex connectivity are determined. We decide on the perfectness of $X_n$ and show that all nonzero eigenvalues of $X_n$ are integers dividing the value $\varphi(n)$ of the Euler function.

ADMINISTRATIVE AND LEGAL STATUS OF THE CAPITAL OF UKRAINE - THE HERO CITY OF KYIV AS A GUARANTEE OF THE RIGHTS OF CITIZENS OF UKRAINE AND THE TERRITORIAL COMMUNITY OF THE CITY

2017 ◽  
Author(s):  
Oleksii Chepov ◽  
Keyword(s):  
Legal Status ◽  
Modern World ◽  
Legal Regime ◽  
Legal Doctrine ◽  
City Councils ◽  
The Social ◽  
District Management ◽  
Definition Of ◽  
The Relationship ◽  
The City

The qualitative and clear definition of the legal regime of the capital of Ukraine, the hero city of Kyiv, is influenced by its legislative enshrinement, however, it should be noted that discussions are ongoing and one of the reasons for the unclear legal status of the capital is the ambiguity of current legislation in this area. Separation of the functions of the city of Kyiv, which are carried out to ensure the rights of citizens of Ukraine and the functions that guarantee the rights of the territorial community of the city of Kyiv. In the modern world, in legal doctrine and practice, the capital is understood as the capital of the country, which at the legislative level received this status and, accordingly, is the administrative and political center of the state, which houses the main state bodies and diplomatic missions of other states. It is the identification of the boundaries of the relationship between the competencies of state administrations and local self-government, in practice, often raises questions about their delimitation and ways of regulatory solution. Peculiarities of local self-government in Kyiv city districts are defined in the provisions of the Law on the Capital, which reveal the norms of the Constitution in these legal relations, according to which the issue of organizing district management in cities belongs to city councils. Likewise, it is unregulated by law to lose the particularity of the legal status of the territory of the city. It should be emphasized that the subject of administrative-legal relations is not a certain administrative-territorial entity, but the social group is designated - the territorial community of the city of Kiev, kiyani. Thus, the provisions on the city of Kyiv partially ignore the potential of the territorial community.

Sign in / Sign up

Export Citation Format

Share Document