Results 31 to 40 of about 187,749 (326)
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +1 more source
Removing Symmetry in Circulant Graphs and Point-Block Incidence Graphs
Mathematics, 2021 An automorphism of a graph is a mapping of the vertices onto themselves such that connections between respective edges are preserved. A vertex v in a graph G is fixed if it is mapped to itself under every automorphism of G. The fixing number of a graph G
Josephine Brooks +5 more
doaj +1 more source
Patched Network and Its Vertex-Edge Metric-Based Dimension
IEEE Access, 2023 The p-type networks are designed with the help of CVNET at topo group Cluj and also given support by nano studio. Such networks develop new p-type surfaces and also represent the decorations of the surfaces.
Sidra Bukhari +3 more
semanticscholar +1 more source
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
Study of biological networks using graph theory
Saudi Journal of Biological Sciences, 2017 As an effective modeling, analysis and computational tool, graph theory is widely used in biological mathematics to deal with various biology problems. In the field of microbiology, graph can express the molecular structure, where cell, gene or protein ...
Wei Gao +3 more
semanticscholar +1 more source
The Morita Theory of Quantum Graph Isomorphisms [PDF]
Communications in Mathematical Physics, 2018 We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism groups. Specifically, we show that graphs quantum isomorphic
Benjamin Musto +2 more
semanticscholar +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
, 2007 The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Computation of Resolvability Parameters for Benzenoid Hammer Graph
Journal of Mathematics, 2022 A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
Vertex sparsifiers : new results from old techniques [PDF]
, 2014 Given a capacitated graph $G = (V,E)$ and a set of terminals $K \subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low congestion, and ...
Gupta, Anupam +10 more
core +1 more source
Connectivity Analysis of Cyclically Balanced Fuzzy Graphs
Fuzzy Information and Engineering, 2015 The concepts of connectivity and cycle connectivity play an important role in fuzzy graph theory. In this article, cyclic cutvertices, cyclic bridges and cyclically balanced fuzzy graphs are discussed.
N. Jicy, Sunil Mathew
doaj +1 more source