\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Chin-Lin Shiue and Hung-Lin Fu}
%
%
\medskip
\noindent
%
%
{\bf The IC-Indices of Complete Bipartite Graphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
Let $G$ be a connected graph, and let $f$
be a function mapping $V(G)$ into ${\Bbb N}$. We define
$f(H)=\sum_{v\in{V(H)}}f(v)$ for each subgraph $H$ of $G$. The
function $f$ is called an IC-coloring of $G$ if for each integer
$k$ in the set $\{1,2,\cdots,f(G)\}$
there exists an (induced) connected subgraph $H$ of $G$ such that
$f(H)=k$, and the IC-index of $G$, $M(G)$, is the maximum value of
$f(G)$ where $f$ is an IC-coloring of $G$. In this paper, we show
that $M(K_{m,n})=3\cdot2^{m+n-2}-2^{m-2}+2$ for each complete
bipartite graph $K_{m,n},\,2\leq m\leq n$.

\bye