A graph G is called CIS if each maximal clique intersects each maximal stable set in G, and is called almost CIS if it has a unique disjoint pair (C, S) consisting of a maximal clique C and a maximal stable set S. While it is still unknown if there exists a good structural characterization of all CIS graphs, in this note we prove the following Andrade-BorosGurvich conjecture: A graph is almost ...

Public 'H I l|||||{ llll IIIH lllll |i||' Hill 11(11 I'll HU fiOuf pe' 'r->DO^e including :r tim» (c rev-ewing initruflion». vejrcrung e«'it "q CJ',3 g»(herini | tllllll llll lllll lllll lllll Hill Hill III' M' lemon o< information Send COTiment» rtat'Omq thi» burden etlimaie Or *"y other *JD«d 0'"«nij coiienior ngton Me»dQuaner» Service». Difff.Of»ie for mfo"^»iion Ope'»'ionj »nd Repon» WS ;e«...

let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

We prove that the strong chromatic index for each k-degenerate graph with maximum degree ∆ is at most (4k − 2)∆ − k(2k − 1) + 1. A strong edge-coloring of a graph G is an edge-coloring so that no edge can be adjacent to two edges with the same color. So in a strong edge-coloring, every color class gives an induced matching. The strong chromatic index χs(G) is the minimum number of colors needed...

‎let $d_{n,m}=big[frac{2n+1-sqrt{17+8(m-n)}}{2}big]$ and‎ ‎$e_{n,m}$ be the graph obtained from a path‎ ‎$p_{d_{n,m}+1}=v_0v_1 cdots v_{d_{n,m}}$ by joining each vertex of‎ ‎$k_{n-d_{n,m}-1}$ to $v_{d_{n,m}}$ and $v_{d_{n,m}-1}$‎, ‎and by‎ ‎joining $m-n+1-{n-d_{n,m}choose 2}$ vertices of $k_{n-d_{n,m}-1}$‎ ‎to $v_{d_{n,m}-2}$‎. ‎zhang‎, ‎liu and zhou [on the maximal eccentric‎ ‎connectivity ind...

the order graph of a group $g$, denoted by $gamma^*(g)$, is a graph whose vertices are subgroups of $g$ and two distinct vertices $h$ and $k$ are adjacent if and only if $|h|big{|}|k|$ or $|k|big{|}|h|$. in this paper, we study the connectivity and diameter of this  graph. also we give a relation between the order graph and prime  graph of a group.