Results 51 to 60 of about 842,964 (161)
A note on zero-divisor graph of amalgamated duplication of a ring along an ideal
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a commutative ring and be a non-zero ideal of . Let be the subring of consisting of the elements for and . In this paper we characterize all isomorphism classes of finite commutative rings with identity and ideal such that is planar.
A. Mallika, R. Kala
doaj +1 more source
The Cayley Sum Graph of Ideals of a Lattice
Discussiones Mathematicae - General Algebra and Applications, 2020 Let L be a lattice, 𝒥(L) be the set of ideals of L and S be a subset of 𝒥 (L). In this paper, we introduce an undirected Cayley graph of L, denoted by ΓL,S with elements of 𝒥 (L) as the vertex set and, for two distinct vertices I and J, I is adjacent to ...
Afkhami Mojgan +2 more
doaj +1 more source
On edge-group choosability of graphs [PDF]
, 2011 In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given.
Khamseh, Amir, Omidi, Gholamreza
core
Crosscap of the non-cyclic graph of groups
AKCE International Journal of Graphs and Combinatorics, 2016 The non-cyclic graph CG to a non locally cyclic group G is as follows: take G∖Cyc(G) as vertex set, where Cyc(G)={x∈G|〈x,y〉 is cyclic for all y∈G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup.
K. Selvakumar, M. Subajini
doaj +1 more source
A Survey of Maximal k-Degenerate Graphs and k-Trees
Theory and Applications of GraphsThis article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj +1 more source
A Branch and Bound Algorithm for Counting Independent Sets on Grid Graphs
Computer Sciences & Mathematics Forum, 2023 A relevant problem in combinatorial mathematics is the problem of counting independent sets of a graph G, denoted by i(G). This problem has many applications in combinatorics, physics, chemistry and computer science.
Guillermo De Ita +2 more
doaj +1 more source
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
On the number of series parallel and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
doaj +1 more source
The role of twins in computing planar supports of hypergraphs
, 2020 A support or realization of a hypergraph $H$ is a graph $G$ on the same vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices induce a connected subgraph of $G$.
Kanj, Iyad A. +4 more
core
Counting Rules for Computing the Number of Independent Sets of a Grid Graph
MathematicsThe issue of counting independent sets of a graph, G, represented as i(G), is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics, and
Guillermo De Ita Luna +2 more
semanticscholar +1 more source