On two dual classes of planar graphs
نویسندگان
چکیده
منابع مشابه
On the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملTwo-Planar Graphs Are Quasiplanar
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further show that quasiplanarity is witnessed by a simple topological drawing, that is, any two edges cross at most once and adjacent edges do not cross.
متن کاملPrimal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs
We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there exists a simultaneous representation of the graph and its dual with 3D boxes. We give a linear-time algorithm for constructing such a represen...
متن کاملTwo Classes of Integral Regular Graphs
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(G) or the Laplacian matrix Lap(G) = D(G)−A(G) of G are integers, where D(G) denote the diagonal matrix of the vertex degrees of G. Let Kn,n+1 ≡ Kn+1,n and K1,p[(p−1)Kp] denote the (n+1)-regular graph with 4n+2 vertices and the p-regular graph with p2 + 1 vertices, respectively. In this paper, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90293-q