Match

Document 
Document Title 

280302620 
Solution of a conjecture on skolem mean graph of stars [K.sub.1,l] [union] [K.sub.1,m] [union] [K.sub.1,n].
In this paper, we prove a conjecture that the three stars
[K.sub.1,l] [union] [K.sub.1,m] [union] [K.sub.1,n] is a skolem mean
graph if [absolute value of m  n] < 4 + l for integers l, m...


280302619 
The order of the sandpile group of infinite complete expansion regular graphs.
The sandpile group or critical group of a graph is an Abelian group
whose order is the number of spanning trees of the graph. In the paper,
the order of the sandpile group of infinite complete...


280302618 
Some families of chromatically unique 5partite graphs.
Let P(G,[lambda]) be the chromatic polynomial of a graph G. Two
graphs G and H are said to be chromatically equivalent, denoted G ~ H,
if P(G,[lambda]) = P(H,[lambda]). We write [G] = {HH ~ G}....


280302617 
On the series expansion of the Ramanujan cubic continued fraction.
If the Ramanujan cubic continued fraction (or its reciprocal) is
expanded as a power series, the sign of the coefficients is periodic
with period 3. We give the combinatorial interpretations for...


280302616 
On the isoperimetric number of line graphs.
The isoperimetric number of a graph G, denoted i(G), was introduced
in 1987 by Mohar [8]. Given a graph G and a subset of X of its vertices,
let [partial derivative](X) denote the edge boundary of...


280302615 
New version of spacelike horizontal biharmonic curves with timelike binormal according to flat metric in Lorentzian Heisenbegr group [Heis.sup.3].
In this paper, we study spacelike biharmonic curves with timelike
binormal according to flat metric in the Lorentzian Heisenberg group
[Heis.sup.3]. We determine the parametric representation of...


280302614 
Fibonacci and super Fibonacci graceful labelings of some cycle related graphs.
We investigate Fibonacci and super Fibonacci graceful labelings for
some cycle related graphs. We prove that the path union of kcopies of
[C.sub.m] where m [equivalent to] 0 (mod 3) is a...


280302613 
Random walk on a finitely generated monoid.
We study the stability of the waiting time of arrival at first
point of length n on a finitely generated monoid. As an example we show
that the asymptotic behavior [psi](n) of the average waiting...


280302612 
Dual spacelike elastic biharmonic curves with timelike principal normal according to dual bishop frames.
In this paper, we study dual spacelike elastic biharmonic curves
with spacelike binormal in dual Lorentzian space [[D.sup.3.sub.1]. We
use Noether's Theorem in our main theorem. Finally we...


280302611 
A variation of decomposition under a length constraint.
Let P1 and P2 be graphical properties. A Smarandachely
(P1,P2)decomposition of a graph G is a decomposition of G into
subgraphs [G.sub.1], [G.sub.2],..., [G.sub.l] [member of] P such...


280302610 
Complete fuzzy graphs.
In this paper, we provide three new operations on fuzzy graphs;
namely direct product, semistrong product and strong product. We give
sufficient conditions for each one of them to be complete and...


280302609 
Divisor cordial graphs.
A divisor cordial labeling of a graph G with vertex set V is a
bijection f from V to {1,2,...,[absolute value of V]} such that an edge
uv is assigned the label 1 if f(u) divides f(v) or f(v)...


280302608 
Neutrosophic rings I.
In this paper, we present some elementary properties of
neutrosophic rings. The structure of neutrosophic polynomial rings is
also presented. We provide answers to the questions raised by...


282762739 
Vertexmean graphs.
Let k [greater than or equal to] 0 be an integer. A Smarandachely
vertexmean klabeling of a (p,q) graph G = (V,E) is such an injection
f: E [right arrow] or [vector] {0, 1, 2, ..., q* + k}, q* =...


282762738 
New mean graphs.
A vertex labeling of G is an assignment f: V(G) [right arrow] or
[vector] {1, 2, 3, ..., p + q} be an injection. For a vertex labeling f,
the induced Smarandachely edge mlabeling [f.sub.s] * for...


282762737 
Lucas gracefulness of almost and nearly for some graphs.
Let G be a (p,q)  graph. An injective function f: V(G) [right
arrow] or [vector] {[l.sub.0], [l.sub.1], [l.sub.2], ..., [l.sub.a]}, (a
[member of] N), is said to be Lucas graceful labeling if an...


282762736 
Forcing (G,D)number of a graph.
In [7], we introduced the new concept (G,D)set of graphs. Let G =
(V,E) be any graph. A (G,D)set of a graph G is a subset S of vertices
of G which is both a dominating and geodominating (or...


282762735 
Graph theoretic parameters applicable to social networks.
Let G = (V,E) be a graph. When G is used to model the network of a
group of individuals, the vertex set V stands for individuals and the
edge set E is used to represent the relations between them....


282762734 
Mediate dominating graph of a graph.
Let S be the set of minimal dominating sets of graph G and U, W
[subset] S with U [union] W = S and U [intersection] W = [empty set]. A
Smarandachely mediate(U, W) dominating graph...


282762733 
Surface embeddability of graphs via reductions.
On the basis of reductions, polyhedral forms of Jordan axiom on
closed curve in the plane are extended to establish characterizations
for the surface embeddability of a graph.


282762732 
Bounds for distanceg domination parameters in circulant graphs.
A circulant graph is a Cayley graph constructed out of a finite
cyclic group [GAMMA] and a generating set A is a subset of [GAMMA]. In
this paper, we attempt to find upper bounds for distanceg...


282762731 
On dynamical chaotic Weyl representations of the vacuum C metric and their retractions.
In this article we will introduce the dynamical chaotic vacuum C
metric when m = 0. The relations between the dynamical chaotic vacuum
and its deformation retract are obtained. Many types of...


282762730 
Complementary signed domination number of certain graphs.
Let G = (V, E) be a simple graph, k [greater than or equal to] 1 an
integer and let f: V (G) [right arrow] {k, k  1, ..., 1, 1, ..., k 
1, k} be 2k valued function. If [MATHEMATICAL EXPRESSION...


282762729 
On the geometry of hypersurfaces of a certain connection in a quasisasakian manifold.
The existence of new connection is proved. In particular case this
connection reduces to several symmetric, semisymmetric and quarter
symmetric connections even some of them are not introduced so...


282762728 
PseudoSmarandache functions of first and second kind.
In this paper we define two kinds of pseudoSmarandache functions.
We have investigated more than fifty terms of each pseudoSmarandache
function. We have proved some interesting results and...


282762727 
Ideal graph of a graph.
In this paper, we introduce ideal graph of a graph and study some
of its properties. We characterize connectedness, isomorphism of graphs
and coloring property of a graph using ideal graph. Also,...


282762726 
Incidence algebras and labelings of graph structures.
Ancykutty Joseph, On Incidence Algebras and Directed Graphs, IJMMS,
31:5(2002), 301305, studied the incidence algebras of directed graphs.
We have extended it to undirected graphs also in our...


268601862 
Bounds on the largest of minimum degree Laplician eigenvalues of a graph.
In this paper we give three upper bounds for the largest of minimum
degree Laplacian eigenvalues of a graph and also obtain a lower bound
for the same.


268601861 
Some results on generalized multi polyBernoulli and Euler polynomials.
The ArakawaKaneko zeta function has been introduced ten years ago
by T. Arakawa and M. Kaneko in [22]. In [22], Arakawa and Kaneko have
expressed the special values of this function at negative...


268601860 
Common fixed points for pairs of weakly compatible mappings.
In this note we establish a common fixed point theorem for a
quadruple of self mappings satisfying a common (E.A) property on a
metric space satisfying weakly compatibility and a generalized...


268601859 
Respectable graphs.
Two graphs X and Y are said to be respectable to each other if A(X)
= A(Y). In this study we explore some graph theoretic and algebraic
properties shared by the respectable graphs.


268601858 
New caracterizations for Bertrand curves in Minkowski 3space.
Bertrand curves have been investigated in Lorentzian and Minkowski
spaces and some characterizations have been given in [1,2,6]. In this
paper, we have investigated the relations between Frenet...


268601857 
Varieties of groupoids and quasigroups generated by linearbivariate polynomials over ring [Z.sub.n].
Some varieties of groupoids and quasigroups generated by
linearbivariate polynomials P(x,y) = a + bx + cy over the ring
[Z.sub.n] are studied. Necessary and sufficient conditions for...


268601856 
On pathos semitotal and total block graph of a tree.
In this communications, the concept of pathos semitotal and total
block graph of a graph is introduced. Its study is concentrated only on
trees. We present a characterization of those graphs whose...


268601855 
The toroidal crossing number of [K.sub.4,n].
In this paper, we study the crossing number of the complete
bipartite graph [K.sub.4,n] in torus and obtain


268601854 
Absolutely harmonious labeling of graphs.
Absolutely harmonious labeling f is an injection from the vertex
set of a graph G with q edges to the set {0,1, 2,q  1}, if each edge uv
is assigned f (u) + f (v) then the resulting edge labels...


268601853 
Effects of Foldings on Free Product of Fundamental Groups.
In this paper, we will introduce free fundamental groups of some
types of manifolds. Some types of conditional foldings restricted on the
elements on free group and their fundamental groups are...


268601852 
Plick graphs with crossing number 1.
In this paper, we deduce a necessary and sufficient condition for
graphs whose plick graphs have crossing number 1. We also obtain a
necessary and sufficient condition for plick graphs to have...


268601851 
Surface embeddability of graphs via joint trees.
This paper provides a way to observe embedings of a graph on
surfaces based on join trees and then characterizations of orientable
and nonorientable embeddabilities of a graph with given genus.


268601850 
Duality theorems of multiobjective generalized disjunctive fuzzy nonlinear fractional programming.
This paper is concerned with the study of duality conditions to
convexconcave generalized multiobjective fuzzy nonlinear fractional
disjunctive programming problems for which the decision set is...


259680574 
Onemother vertex graphs.
In this paper we will define a new type of graph. The idea of this
definition is based on when we illustrate the cardiovascular system by a
graph we find that not all vertices have the same...


259680573 
A note on line graphs.
In this note we define two generalizations of the line graph and
obtain some results. Also, we mark some open problems.


259680572 
Group connectivity of 1edge deletable IMextendable graphs.
A graph G is called a kedges deletable IMextendable graph, if G 
F is IMextendable for every F [subset or equal to] E(G) with [absolute
value of F] = k. Denoted by [[conjunction.sub.g](G) the...


259680571 
A note on antipodal signed graphs.
A Smarandachely ksigned graph (Smarandachely kmarked graph) is an
ordered pair S = (G, [sigma]) (S = (G, [micro])) where G = (V,E) is a
graph called underlying graph of S and [sigma] : E [right...


259680570 
The number of spanning trees in generalized complete multipartite graphs of fantype.
Let [K.sub.k,[bar.n]] be a complete kpartite graph of order n and
let [K.sup.F.sub.k,[bar.n]] be a generalized complete kpartite graph of
order n spanned by the fan set [MATHEMATICAL EXPRESSION...


259680569 
A note on admissible Mannheim curves in Galilean space [G.sub.3].
In this paper, the definition of the Mannheim partner curves in
Galilean space [G.sub.3] is given. The relationship between the
curvatures and the torsions of the Mannheim partner curves with...


259680568 
Edge maximal [C.sub.3] and [C.sub.5]edge disjoint free graphs.
For a positive integer k, let G(n;[E.sub.2k+1]) be the class of
graphs on n vertices containing no two 2k +1edge disjoint cycles. Let
f(n;[E.sub.2k+1]) = max{E(G) : G [member of]...


259680567 
Surface embeddability of graphs via treetravels.
This paper provides a characterization for surface embeddability of
a graph with any given orientable and nonorientable genus not zero via a
method discovered by the author thirty years ago.


259680566 
Super Fibonacci graceful labeling of some special class of graphs.
A SmarandacheFibonacci Triple is a sequence S(n), n [greater than
or equal to] 0 such that S(n) = S(n 1) + S(n 2), where S(n) is the
Smarandache function for integers n [greater than or equal to]...


259680565 
Elementary abelian regular coverings of cube.
For a give finite connected graph [GAMMA], a group H of
automorphisms of [GAMMA] and a finite group A, a natural question can be
raised as follows: Find all the connected regular coverings of...
