In this paper, we define irregular interval-valued fuzzy graphs and their various classifications. Size of regular interval-valued fuzzy graphs is derived. The relation between highly and neighbourly irregular interval-valued fuzzy graphs are established. Some basic theorems related to the stated graphs have also been presented.

The main purpose of this paper is to introduce the notion of vague h-morphism on vague graphs and regular vague graphs. The action of vague h-morphism on vague strong regular graphs are studied. Some elegant results on weak and co weak isomorphism are derived. Also, [Formula: see text]-complement of highly irregular vague graphs are defined.

let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...

We establish upper and lower bounds for the 2-limited broadcast domination number of various grid graphs, in particular Cartesian product two paths, a path cycle, cycles. The are derived by explicit constructions. obtained via linear programming duality finding fractional multipacking numbers these graphs.

In this paper, we describe a methodology for comparing networks represented as weighted graphs. The key idea is to associate a probability density function derived from the graph Laplacian, and then compute the Wasserstein distance between the derived densities of the respective graphs. This has wide applications to various networks including biological and financial.

We use production matrices to count several classes of geometric graphs. present novel for non-crossing partitions, connected graphs, and k -angulations, which provide another, simple elegant, way counting the number such objects. Counting graphs is then equivalent calculating powers a matrix. Applying technique Riordan Arrays these matrices, we establish new formulas numbers as well combinator...

asymptotically exact and nonlocal fourth order nonlinear evolution equations are derived for two coupled fourth order nonlinear evolution equations have been derived in deep water for two capillary-gravity wave packets propagating in the same direction in the presence of wind flowing over water.we have used a general method, based on zakharov integral equation.on the basis of these evolution eq...

We consider the Dirac equation on periodic networks (quantum graphs). The self-adjoint quasi boundary conditions are derived. secular allowing us to find energy spectrum of particles quantum graphs is obtained. Band spectra different topologies calculated. Universality probability be in for certain graph observed.

The notion of (circular) colorings of edge-weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds to the traveling salesman problem (metric case). It also gives rise to a new definition of the ch...

This paper introduces logarithmic curvature and torsion graphs for analyzing planar and space curves. We present a method for drawing these graphs from any differentiable parametric curves and clarify the characteristics of these graphs. We show several examples of theses graphs drawn from planar and 3D Bézier curves. From the graphs, we can see some interesting properties of curves that cannot...