Results 31 to 40 of about 750,580 (290)
Turán Problems and Shadows III: Expansions of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2015 The expansion $G^+$ of a graph $G$ is the $3$-uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a new vertex disjoint from $V(G)$ such that distinct edges are enlarged by distinct vertices. Let $ex_3(n,F)$ denote the maximum number of edges in a $3$-uniform hypergraph with $n$ vertices not containing any copy of a $3$-uniform ...
Alexandr V. Kostochka +2 more
openaire +4 more sources
Research on Shadow Rendering Method in Hybrid Scene [PDF]
Jisuanji gongcheng, 2016 In a hybrid scene of local and remote rendering,in order to make the scene more realistic,a shadow rendering method is proposed based on the characteristics of simple mobile terminal scene,and strong object interaction.On the server side,a combination of
CHEN Guodong,YE Dongwen,DANG Qiqi
doaj +1 more source
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
Facial Image Shadow Removal via Graph-based Feature Fusion
, 2023 Despite natural image shadow removal methods have made significant progress, they often perform poorly for facial image due to the unique features of the face.
Chen, Ben +3 more
core +1 more source
On the Sombor index and Sombor energy of m-splitting graph and m-shadow graph of regular graphs [PDF]
, 2022 A vertex-degree-based topological index named as Sombor index of a simple graph G with n vertices was recently introduced by I. Gutman. In this paper, we find Sombor index of m-splitting graph and m-shadow graph.
Singh, Randhir, Patekar, S. C.
core
PAIR DIFFERENCE CORDIALITY OF MIRROR GRAPH,SHADOW GRAPH AND SPLITTING GRAPH OF CERTAIN GRAPHS
Maltepe Journal of Mathematics, 2022 In this paper we dicuss the pair difference cordility of Mirror graph, Splitting graph, Shadow graph of some graphs. we have studied about the pair difference cordility of Mirror graph, Splitting graph, Shadow graph of some graphs.Investigation of the pair difference cordility of Mirror graph, Splitting graph, Shadow graph of some special graphs are ...
PONRAJ, R, A, Gayathrı, SOMASNDARAM, S
openaire +2 more sources
ON ZAGREB ENERGIES OF SOME GRAPH OPERATIONS [PDF]
Journal of Algebraic SystemsRecently, Zagreb energies, a graph invariant based on the eigenvalues of the Zagreb matrices have been proposed as an analogous to graph energy. In this communication, the Zagreb energies and Zagreb spectral radius are examined in relation to a number of
Idweep Gogoi +2 more
doaj +1 more source
Monitoring of Shadow Cash Flows Using Computer Modelling [PDF]
Экономика региона, 2018 The computer simulation of economic systems is a promising tool in the development of the theory of the country’s economic security. We have examined the Russian banking legislation and synthesized judicial economic expertise.
Evgeniya Vladimirovna Baturina +1 more
doaj +1 more source
Moving Shadow Detection in Video Using Cepstrum [PDF]
, 2010 Moving shadows constitute problems in various applications such as image segmentation and object tracking. The main cause of these problems is the misclassification of the shadow pixels as target pixels.
Çetin, A. Enis +5 more
core +2 more sources
i-Hamiltonian laceability in Shadow Graphs
Journal of Physics: Conference Series, 2021 Abstract Extracting a Hamiltonian path or cycle in a connected graph G(V,E)has a wide scope in graph theory. Determination of Hamiltonian path in different graph structures is widely researched problem. If h ( g ) is the size of a Hamiltonian walk in G then G is termed as i ...
M.R Sumitra Devi, A Girisha
openaire +1 more source