Results 21 to 30 of about 1,255,445 (300)
IEEE Access, 2018 In this paper, we have proposed altogether different and new approaches for the computation of all possible spanning trees of a simple, undirected, and connected graph.
Maumita Chakraborty +2 more
doaj +1 more source
Some Bounds of Weighted Entropies with Augmented Zagreb Index Edge Weights
Discrete Dynamics in Nature and Society, 2020 The graph entropy was proposed by Körner in the year 1973 when he was studying the problem of coding in information theory. The foundation of graph entropy is in information theory, but it was demonstrated to be firmly identified with some established ...
Yujie Huang +4 more
doaj +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2021 Although deep learning-based methods have been successfully applied to polarimetric synthetic aperture radar (PolSAR) image classification tasks, most of the available techniques are not suitable to deal with PolSAR data on irregular domains, e.g ...
Shijie Ren, Feng Zhou
doaj +1 more source
On the uniqueness of continuation of a partially defined metric
Theory and Applications of Graphs, 2022 The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let $G=G(V,E)$ be an undirected graph with the set of vertices $V$ and the set of edges $E$.
Evgeniy Petrov
doaj +1 more source
On weighted graph homomorphisms [PDF]
, 2004 For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when $G$ is a disjoint union of $K_{n,n}$'s. This generalizes a result of J.
David J. Galvin, Prasad Tetali
openaire +2 more sources
Weighted Graph Colorings [PDF]
Journal of Statistical Physics, 2009 We study two weighted graph coloring problems, in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given color. We exhibit a weighted chromatic polynomial $Ph(G,q,w)$ associated with this problem that generalizes the chromatic ...
Chang, Shu-Chiuan, Shrock, Robert
openaire +2 more sources
Unfoldings and coverings of weighted graphs
Fundamenta Informaticae, 2023 Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they are both defined in terms of surjective graph homomorphisms.
Courcelle, Bruno, Métivier, Yves
openaire +4 more sources
Identifying the Shortest Path of a Semidirected Graph and Its Application
Mathematics, 2022 The basic goal of this research is to find the shortest path of a semidirected graph and apply it to the road network system. In the field of graph theory, networks are described as directed graphs, undirected graphs, or a combination of both.
Rakhi Das +4 more
doaj +1 more source
Watersheds on weighted graphs [PDF]
Pattern Recognition Letters, 2014 The watershed is an efficient and versatile segmentation tool, as it partitions the images into disjoint catchment basins. We study the watershed on node or edge weighted graphs. We do not aim at constructing a partition of the nodes but consider the catchment zones, i.e., the attraction zones of a drop of water. Often, such zones largely overlap. In a
openaire +4 more sources
Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees
Mathematics, 2020 This paper deals with the maximum weighted independent set (MWIS) problem. We consider several robust variants of the MWIS problem on trees and prove that most of them are NP-hard.
Ana Klobučar, Robert Manger
doaj +1 more source