6805642
Uniformly cordial graphs
Let G be a graph with vertex set V(G) and edge set E(G). A labeling f:V(G)->{0,1} induces an edge labeling f^*:E(G)->{0,1}, defined by f^*(xy)=|f(x)-f(y)| for each edge [email protected]?E(G). For [email protected]?{0,1}, let n"i(f)=|{[email protected]?V(G):f(v)=i}| and m"i(f)=|{[email protected]?E(G):f^*(e)=i}|. Let c(f)=|m"0(f)-m"1(f)|. A labeling f of a graph G is called friendly if |n"0(f)-n"1(f)|= =2 is uniformly cordial if and only if n=3 and G=K"3, or n is even and G=K"1","n"-"1.
35676657
On skolem graceful graphs
Abstract A Skolem graceful labelling of graphs is introduced. It is shown that a tree is Skolem graceful iff it is graceful. The Skolem deficiency of a graph is defined and Skolem deficiencies of some well-known graphs are calculated. The class of Skolem graceful graphs is shown to be finite universal.
650244
IC-Colorings and IC-Indices of graphs
Given a coloring f:V(G)->N of graph G and any subgraph H@?G we define f"s(H)=@?"v"@?"V"("H")f(v). In particular, we denote f"s(G) by S(f). The coloring f is called an IC-coloring if for any integer k@?[1,S(f)] there is a connected subgraph H@?G such that f"s(H)=k. Also, we define the IC-index of G to beM(G)=max{S(f):f is an IC-coloring of G}.In this paper we examine some well-known classes of graphs and determine their IC-indices. In addition, several conjectures are proposed.
5645473
On Magic Strength of Graph
13467926
Injectivity Conditions of 2D and 3D Uniform Cubic B-Spline Functions
Uniform cubic B-spline functions have been used for mapping functions in various areas such as image warping and morphing, 3D deformation, and volume morphing. The injectivity (one-to-one property) of a mapping function is crucial to obtaining desirable results in these areas. This paper considers the injectivity conditions of 2D and 3D uniform cubic B-spline functions. We propose a geometric interpretation of the injectivity of a uniform cubic B-spline function, with which 2D and 3D cases can be handled in a similar way. Based on our geometric interpretation, we present sufficient conditions for injectivity which are represented in terms of control point displacements. These sufficient conditions can be easily tested and will be useful in guaranteeing the injectivity of mapping functions in application areas.
55517887
Creativity in Digital Libraries and Information Retrieval Environments
Inspired by Weisberg’s [20] argument that creativity exists in everyone and on the assumption that every information seeker is creative and undergoes a creative process in information seeking, this paper synthesizes a holistic “creativity” model and “information seeking” model to identify stages in a creative process for information seeking. A pilot study was conducted to verify these stages and also examine if present digital libraries and information retrieval environments provide “creative” features to support creative information seeking. We discussed these initial findings and made recommendations for further work to better support creative information seeking in digital libraries and information retrieval environments.
15970244
Truly Selective Refinement of Progressive Meshes
This paper presents a novel selective refinement scheme of progressive meshes. In previous schemes, topology information in the neighborhood of a collapsed edge is stored in the analysis phase. A vertex split or edge collapse transformation is possible in the synthesis phase only if the configuration of neighborhood vertices in the current mesh corresponds to the stored topology information. In contrast, the proposed scheme makes it possible to apply a vertex split or an edge collapse to any selected vertex or edge in the current mesh without a precondition. Our main observation is that the concept of a dual piece can be used to clearly enumerate and visualize the set of all possible selectively refined meshes for a given mesh. Our refinement scheme is truly selective in the sense that each vertex split or edge collapse can be performed without incurring additional vertex split and/or edge collapse transformations.
232491
Transitive Mesh Space of a Progressive Mesh
The paper investigates the set of all selectively refined meshes that can be obtained from a progressive mesh. We call the set the transitive mesh space of a progressive mesh and present a theoretical analysis of the space. We define selective edge collapse and vertex split transformations, which we use to traverse all selectively refined meshes in the transitive mesh space. We propose a complete selective refinement scheme for a progressive mesh based on the transformations and compare the scheme with previous selective refinement schemes in both theoretical and experimental ways. In our comparison, we show that the complete scheme always generates selectively refined meshes with smaller numbers of vertices and faces than previous schemes for a given refinement criterion. The concept of dual pieces of the vertices in the vertex hierarchy plays a central role in the analysis of the transitive mesh space and the design of selective edge collapse and vertex split transformations.
387033
Adapting Content for Mobile Devices in Heterogeneous Collaboration Environments
The portability of new miniaturized devices, together with their ability to connect conveniently to networks in different places, makes mobile computing possible. Recent advances that have led to increasing bandwidths, for wireless communications, enable mobile users to utilize a vast range of sophisticated services such as real-time collaborative services. Garnet Collaborative system is a universal accessible collaborative environment supporting synchronous communication and universal accessibility from a wide range of devices. Garnet Message System Micro Edition (GMSME) is developed to integrate heterogeneous mobile devices into the Garnet collaborative system. Garnet integrates desktop in traditional LAN environments, wireless LAN based mobile devices, and pervasive 3G communication technology seamlessly. In this paper, we describe the process of adapting content in GMSME. GMSME provides application-aware transcoding, to tune the shared resources, for different collaborative models. Also, it optimizes shared resources for each heterogeneous client environments.