Results 241 to 250 of about 473,067 (264)
Some of the next articles are maybe not open access.
The differential of the strong product graphs
International Journal of Computer Mathematics, 2015Let G=(V, E) be a graph of order n and let B(D) be the set of vertices in V ∖ D that have a neighbour in the set D. The differential of a set D is defined as ∂ (D)=|B(D)|−|D| and the differential of a graph to equal the maximum value of ∂(D) for any subset D of V.
S. Bermudo +3 more
semanticscholar +2 more sources
Super Edge-Connectivity of Strong Product Graphs
Journal of Interconnection Networks, 2017The super edge-connectivity [Formula: see text] of a connected graph G is the minimum cardinality of an edge-cut F in G such that every component of G − F contains at least two vertices. Denote by [Formula: see text] the strong product of graphs G and H. For two graphs G and H, Yang proved that [Formula: see text]. In this paper, we give another proof
Zhao Wang +3 more
semanticscholar +2 more sources
A note on clique immersion of strong product graphs
Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chuanshu Wu, Zijian Deng
semanticscholar +3 more sources
On the Lower Bound of Vertex Forwarding Index of Strong Product Graphs
International Conference on Advanced Computer Theory and Engineering, 2023The selection of routing in a network has a direct impact on the effectiveness of the communication system. Good routing selection will not cause blockage or collapse of the communication network due to the damage of a few nodes in the network.
Weimin Qian, Feng Li
semanticscholar +1 more source
The Wide Diameter of Strong Product Graphs of Complete Graphs and any Graphs
2023 IEEE 11th International Conference on Information, Communication and Networks (ICICN), 2023In large-scale interconnect networks, the properties of transmission delay and fault tolerance are highly valued. A good network should have low transmission delay and high fault tolerance regardless of whether it is a wired or wireless network.
Hongru Wang, Feng Li
semanticscholar +1 more source
On the Laplacians for Strong Product Graphs Based on Polyacene Graphs
Polycyclic aromatic compounds (Print), 2021Let Hn be the molecular graph of a linear polyacene chain. In this paper, we introduce a kind of linear polyacene cylinder graph which is the strong product of two automorphism polyacene graphs Hn and Next, we obtain that the Laplacian spectrum of ...
Jia-bao Liu, Jiao‐Jiao Gu, S. Hayat
semanticscholar +1 more source
Tensor products and strong products of soft graphs
Discrete Mathematics, Algorithms and Applications, 2022Molodtsov developed soft set theory in 1999 as an approach for modeling vagueness and uncertainty. Many academics currently employ soft set theory to solve decision-making problems. A parameterized point of view for graphs is provided using the idea of soft graphs.
Bobin George +2 more
openaire +2 more sources
Note on strong product graph dimension
The Art of Discrete and Applied Mathematics, 2023Summary: In this paper we define a new dimension of graphs based on the strong product. Strong product can be viewed as a categorical product in a modified category. Unlike in the standard case where the system of basic generators (``simplest objects'') is very transparent but necessarily infinite, we have here a single generator.
Jaroslav Nesetril, Ales Pultr
openaire +1 more source
Pancyclicity of Strong Products of Graphs
Graphs and Combinatorics, 2004A graph with \(n\) vertices is pancyclic if it contains a cycle of length \(s\) for all \(s\), \(3\leq s\leq n\). In particular, a pancyclic graph is Hamiltonian. The {strong product} of \(k\) graphs \(G_1=(V_1,E_1),\dots, G_k=(V_k,E_k)\) is the graph \(G_1\times\cdots\times G_k\) with \(V_1\times\cdots \times V_k\) as set of vertices and two vertices \
Daniel Král +3 more
openaire +2 more sources