Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study  connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids  from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...

Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...

design of crystal-like lattices can be achieved by using some net operations. hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. the networks herein presented are related to the dyck graph and described in terms of omega polynomial and piv polynomials.

todeschini et al. have recently suggested to consider multiplicative variants of additive graphinvariants, which applied to the zagreb indices would lead to the multiplicative zagrebindices of a graph g, denoted by ( ) 1  g and ( ) 2  g , under the name first and secondmultiplicative zagreb index, respectively. these are define as  ( )21 ( ) ( )v v gg g d vand ( ) ( ) ( )( )2 g d v d v gu...

this work deals with effects of asymmetric stiffness on the dynamic behaviour of the rotor system. the analysis is presented through an extended lagrangian hamiltonian mechanics on the asymmetric rotor system, where symmetries are broken in terms of the rotor stiffness. the complete dynamics of asymmetries of rotor system is investigated with a case study. in this work, a mathematical model is ...

reliability wiener number is a modification of the original wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q<= abn/4 and 5<=a < b = 0 (iii) triregular graphs of degree 1, a, b that are quadran...

The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...