Results 21 to 30 of about 65,626 (208)

On a Total Version of 1-2-3 Conjecture

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction.
Baudon Olivier   +5 more
doaj   +1 more source

Group twin coloring of graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
For a given graph $G$, the least integer $k\geq 2$ such that for every Abelian group $\mathcal{G}$ of order $k$ there exists a proper edge labeling $f:E(G)\rightarrow \mathcal{G}$ so that $\sum_{x\in N(u)}f(xu)\neq \sum_{x\in N(v)}f(xv)$ for each edge ...
Sylwia Cichacz, Jakub Przybyło
doaj   +1 more source

Improving Satellite Retrieval of Coastal Aquaculture Pond by Adding Water Quality Parameters

open access: yesRemote Sensing, 2022
Coastal aquaculture is an important supply of animal proteins for human consumption, which is expanding globally. Meanwhile, extensive aquaculture may increase nutrient loadings and environmental concerns along the coast.
Yuxuan Hou   +3 more
doaj   +1 more source

The Influence of Polarimetric Parameters and an Object-Based Approach on Land Cover Classification in Coastal Wetlands

open access: yesRemote Sensing, 2014
The purpose of this study was to examine how different polarimetric parameters and an object-based approach influence the classification results of various land use/land cover types using fully polarimetric ALOS PALSAR data over coastal wetlands in ...
Yuanyuan Chen   +3 more
doaj   +1 more source

On the Total-Neighbor-Distinguishing Index by Sums

open access: yesGraphs Comb., 2015
We consider a proper coloring c of edges and vertices in a simple graph and the sum f(v) of colors of all the edges incident to v and the color of a vertex v.
M. Pilsniak, M. Woźniak
semanticscholar   +1 more source

Graph Neural Network Recommendation Algorithm Based on Multimodal Fusion [PDF]

open access: yesJisuanji gongcheng
Many existing Graph Neural Network(GNN) recommendation algorithms use the node number information of the user-item interaction graph for training and learn the high-order connectivity among user and item nodes to enrich their representations.
Zhiqiang WU, Qing XIE, Lin LI, Yongjian LIU
doaj   +1 more source

Convective/Stratiform Precipitation Classification Using Ground-Based Doppler Radar Data Based on the K-Nearest Neighbor Algorithm

open access: yesRemote Sensing, 2019
Stratiform and convective rain types are associated with different cloud physical processes, vertical structures, thermodynamic influences and precipitation types. Distinguishing convective and stratiform systems is beneficial to meteorology research and
Zhida Yang, Peng Liu, Yi Yang
doaj   +1 more source

Comparison of Haemophilus parasuis reference strains and field isolates by using random amplified polymorphic DNA and protein profiles

open access: yesBMC Microbiology, 2012
Background Haemophilus parasuis is the causative agent of Glässer’s disease and is a pathogen of swine in high-health status herds. Reports on serotyping of field strains from outbreaks describe that approximately 30% of them are nontypeable and ...
Zehr Emilie S   +2 more
doaj   +1 more source

On the Neighbor Sum Distinguishing Index of Planar Graphs [PDF]

open access: yesJournal of Graph Theory, 2014
Let c be a proper edge coloring of a graph G=(V,E) with integers 1,2,…,k . Then k≥Δ(G) , while Vizing's theorem guarantees that we can take k≤Δ(G)+1 .
Marthe Bonamy, J. Przybylo
semanticscholar   +1 more source

Quasi-majority neighbor sum distinguishing edge-colorings [PDF]

open access: yesDiscrete Mathematics
In this paper, a $k$-edge-coloring of $G$ is any mapping $c:E(G)\longrightarrow [k]$. The edge-coloring $c$ of $G$ naturally defines a vertex-coloring $\sigma_{c}: V(G) \to \mathbb{N}$, where $\sigma_{c}(v)=\sum_{u\in N_G(v)}c(vu)$ for every vertex $v\in
R. Kalinowski   +3 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy