a spanning tree of graph g is a spanning subgraph of g that is a tree. in this paper, we focusour attention on (n,m) graphs, where m = n, n + 1, n + 2 and n + 3. we also determine somecoefficients of the laplacian characteristic polynomial of fullerene graphs.

This paper describes the design of, and results from, a calibration system for optical linear displacement (shadow) sensors. The shadow sensors were designed to detect "Violin-Mode" (VM) resonances in the 0.4 mm diameter silica fibre suspensions of the test masses/mirrors of Advanced Laser Interferometer Gravitational Wave Observatory gravitational wave interferometers. Each sensor illuminated ...

The atmospheric correction of optical remote sensing data requires the determination of aerosol and gas optical properties. A method is presented which allows the detection of the aerosol scattering effects from optical remote sensing data at spatial sampling intervals below 5 m in cloud-free situations from cast shadow pixels. The derived aerosol optical thickness distribution is used for impr...

Let G be an undirected graph with vertex and edge sets V (G) E(G), respectively. A set S ⊆ is called a hop independent dominating of if both G. The minimum cardinality G, denoted by γhih(G), the domination number In this paper, we show that lies between independence We characterize these types in shadow graph, join, corona, lexicographic product two graphs. Moreover, either exact values or boun...

In the n-dimensional cube, we determine the maximum size of antichains having a lower shadow of exactly m elements in the k-th level.

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...

We propose a single region shadow classifier based on a multikernel SVM. Our multikernel model is a linear combination of χ2 and Earth Mover’s Distance(EMD)[5] kernels that operate on texture and color histograms disjointly. This single region classifier already outperforms the more complex state of art methods, without performing MRF/CRF optimization. The local appearance of a single region is...

We design an algorithm based on illuminant invariance theory to find shadow regions in a colour image. Shadows are caused by a local change in both the colour and the intensity of illumination. Using both chromaticity and intensity cues, an illuminant discontinuity measure is derived by which shadow edges can be locally identified. We model the problem of finding shadows by a Markov Random Fiel...