Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSome Algebraic Properties of Sierpinski-Type Graphs
102
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper deals with some of the algebraic properties of Sierpinski graphs and a family of regular generalized Sierpinski graphs. For the family of regular generalized Sierpinski graphs, we obtain their spectrum and characterize those graphs that are Cayley graphs. As a by-product, a new family of non-Cayley vertex-transitive graphs, and consequently, a new set of non-Cayley numbers are introduced. We also obtain the Laplacian spectrum of Sierpinski graphs in some particular cases, and make a conjecture on the general case.
rate research
Read More
ErdH{o}s posed the problem of finding conditions on a graph $G$ that imply the largest number of edges in a triangle-free subgraph is equal to the largest number of edges in a bipartite subgraph. We generalize this problem to general cases. Let $delta_r$ be the least number so that any graph $G$ on $n$ vertices with minimum degree $delta_rn$ has the property $P_{r-1}(G)=K_rf(G),$ where $P_{r-1}(G)$ is the largest number of edges in an $(r-1)$-partite subgraph and $K_rf(G)$ is the largest number of edges in a $K_r$-free subgraph. We show that $frac{3r-4}{3r-1}<delta_rlefrac{4(3r-7)(r-1)+1}{4(r-2)(3r-4)}$ when $rge4.$ In particular, $delta_4le 0.9415.$
Let $D=(G,mathcal{O},w)$ be a weighted oriented graph whose edge ideal is $I(D)$. In this paper, we characterize the unmixed property of $I(D)$ for each one of the following cases: $G$ is an $SCQ$ graph; $G$ is a chordal graph; $G$ is a simplicial graph; $G$ is a perfect graph; $G$ has no $4$- or $5$-cycles; $G$ is a graph without $3$- and $5$-cycles; and ${rm girth}(G)geqslant 5$.
We initiate the study of p-adic algebraic groups G from the stability-theoretic and definable topological-dynamical points of view, that is, we consider invariants of the action of G on its space of types over Q_p in the language of fields. We consider the additive and multiplicative groups of Q_p and Z_p, the group of upper triangular invertible 2times 2 matrices, SL(2,Z_p), and, our main focus, SL(2,Q_p). In all cases we identify f-generic types (when they exist), minimal subflows, and idempotents. Among the main results is that the ``Ellis group of SL(2,Q_p)$ is the profinite completion of Z, yielding a counterexample to Newelskis conjecture with new features: G = G^{00} = G^{000} but the Ellis group is infinite. A final section deals with the action of SL(2,Q_p) on the type-space of the projective line over Q_p.
109 -
Sunil Kumar R (Research Scholar
, Department of Computer Applications
, n Cochin University of Science
2014
There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest path between them. In this paper we present betweenness centrality of some important classes of graphs.
The edit distance function of a hereditary property $mathscr{H}$ is the asymptotically largest edit distance between a graph of density $pin[0,1]$ and $mathscr{H}$. Denote by $P_n$ and $C_n$ the path graph of order $n$ and the cycle graph of order $n$, respectively. Let $C_{2n}^*$ be the cycle graph $C_{2n}$ with a diagonal, and $widetilde{C_n}$ be the graph with vertex set ${v_0, v_1, ldots, v_{n-1}}$ and $E(widetilde{C_n})=E(C_n)cup {v_0v_2}$. Marchant and Thomason determined the edit distance function of $C_6^{*}$. Peck studied the edit distance function of $C_n$, while Berikkyzy et al. studied the edit distance of powers of cycles. In this paper, by using the methods of Peck and Martin, we determine the edit distance function of $C_8^{*}$, $widetilde{C_n}$ and $P_n$, respectively.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
