{"title":"拉普拉斯边能图新族","authors":"Cahit Dede","doi":"10.1007/s00236-024-00454-y","DOIUrl":null,"url":null,"abstract":"<div><p>Laplacian matrix and its spectrum are commonly used for giving a measure in networks in order to analyse its topological properties. In this paper, Laplacian matrix of graphs and their spectrum are studied. Laplacian energy of a graph <i>G</i> of order <i>n</i> is defined as <span>\\( \\mathrm{{LE}}(G) = \\sum _{i=1}^n|\\lambda _i(L)-{\\bar{d}}|\\)</span>, where <span>\\(\\lambda _i(L)\\)</span> is the <i>i</i>-th eigenvalue of Laplacian matrix of <i>G</i>, and <span>\\({\\bar{d}}\\)</span> is their average. If <span>\\(\\mathrm{{LE}}(G) = \\mathrm{{LE}}(K_n)\\)</span> for the complete graph <span>\\(K_n\\)</span> of order <i>n</i>, then <i>G</i> is known as <i>L</i>-borderenergetic graph. In the first part of this paper, we construct three infinite families of non-complete disconnected <i>L</i>-borderenergetic graphs: <span>\\(\\Lambda _1 = \\{ G_{b,j,k} = [(((j-2)k-2j+2)b+1)K_{(j-1)k-(j-2)}] \\cup b(K_j \\times K_k)| b,j,k \\in {{\\mathbb {Z}}}^+\\}\\)</span>, <span>\\( \\Lambda _2 = \\{G_{2,b} = [K_6 \\nabla b(K_2 \\times K_3)] \\cup (4b-2)K_9 | b\\in {{\\mathbb {Z}}}^+ \\}\\)</span>, <span>\\( \\Lambda _3 = \\{G_{3,b} = [bK_8 \\nabla b(K_2 \\times K_4)] \\cup (14b-4)K_{8b+6} | b\\in {{\\mathbb {Z}}}^+ \\}\\)</span>, where <span>\\(\\nabla \\)</span> is join operator and <span>\\(\\times \\)</span> is direct product operator on graphs. Then, in the second part of this work, we construct new infinite families of non-complete connected <i>L</i>-borderenergetic graphs <span>\\(\\Omega _1= \\{K_2 \\nabla \\overline{aK_2^r} \\vert a\\in {{\\mathbb {Z}}}^+\\}\\)</span>, <span>\\(\\Omega _2 = \\{\\overline{aK_3 \\cup 2(K_2\\times K_3)}\\vert a\\in {{\\mathbb {Z}}}^+ \\}\\)</span> and <span>\\(\\Omega _3 = \\{\\overline{aK_5 \\cup (K_3\\times K_3)}\\vert a\\in {{\\mathbb {Z}}}^+ \\}\\)</span>, where <span>\\({\\overline{G}}\\)</span> is the complement operator on <i>G</i>.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New families of Laplacian borderenergetic graphs\",\"authors\":\"Cahit Dede\",\"doi\":\"10.1007/s00236-024-00454-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Laplacian matrix and its spectrum are commonly used for giving a measure in networks in order to analyse its topological properties. In this paper, Laplacian matrix of graphs and their spectrum are studied. Laplacian energy of a graph <i>G</i> of order <i>n</i> is defined as <span>\\\\( \\\\mathrm{{LE}}(G) = \\\\sum _{i=1}^n|\\\\lambda _i(L)-{\\\\bar{d}}|\\\\)</span>, where <span>\\\\(\\\\lambda _i(L)\\\\)</span> is the <i>i</i>-th eigenvalue of Laplacian matrix of <i>G</i>, and <span>\\\\({\\\\bar{d}}\\\\)</span> is their average. If <span>\\\\(\\\\mathrm{{LE}}(G) = \\\\mathrm{{LE}}(K_n)\\\\)</span> for the complete graph <span>\\\\(K_n\\\\)</span> of order <i>n</i>, then <i>G</i> is known as <i>L</i>-borderenergetic graph. In the first part of this paper, we construct three infinite families of non-complete disconnected <i>L</i>-borderenergetic graphs: <span>\\\\(\\\\Lambda _1 = \\\\{ G_{b,j,k} = [(((j-2)k-2j+2)b+1)K_{(j-1)k-(j-2)}] \\\\cup b(K_j \\\\times K_k)| b,j,k \\\\in {{\\\\mathbb {Z}}}^+\\\\}\\\\)</span>, <span>\\\\( \\\\Lambda _2 = \\\\{G_{2,b} = [K_6 \\\\nabla b(K_2 \\\\times K_3)] \\\\cup (4b-2)K_9 | b\\\\in {{\\\\mathbb {Z}}}^+ \\\\}\\\\)</span>, <span>\\\\( \\\\Lambda _3 = \\\\{G_{3,b} = [bK_8 \\\\nabla b(K_2 \\\\times K_4)] \\\\cup (14b-4)K_{8b+6} | b\\\\in {{\\\\mathbb {Z}}}^+ \\\\}\\\\)</span>, where <span>\\\\(\\\\nabla \\\\)</span> is join operator and <span>\\\\(\\\\times \\\\)</span> is direct product operator on graphs. Then, in the second part of this work, we construct new infinite families of non-complete connected <i>L</i>-borderenergetic graphs <span>\\\\(\\\\Omega _1= \\\\{K_2 \\\\nabla \\\\overline{aK_2^r} \\\\vert a\\\\in {{\\\\mathbb {Z}}}^+\\\\}\\\\)</span>, <span>\\\\(\\\\Omega _2 = \\\\{\\\\overline{aK_3 \\\\cup 2(K_2\\\\times K_3)}\\\\vert a\\\\in {{\\\\mathbb {Z}}}^+ \\\\}\\\\)</span> and <span>\\\\(\\\\Omega _3 = \\\\{\\\\overline{aK_5 \\\\cup (K_3\\\\times K_3)}\\\\vert a\\\\in {{\\\\mathbb {Z}}}^+ \\\\}\\\\)</span>, where <span>\\\\({\\\\overline{G}}\\\\)</span> is the complement operator on <i>G</i>.</p></div>\",\"PeriodicalId\":7189,\"journal\":{\"name\":\"Acta Informatica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00236-024-00454-y\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-024-00454-y","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Laplacian matrix and its spectrum are commonly used for giving a measure in networks in order to analyse its topological properties. In this paper, Laplacian matrix of graphs and their spectrum are studied. Laplacian energy of a graph G of order n is defined as \( \mathrm{{LE}}(G) = \sum _{i=1}^n|\lambda _i(L)-{\bar{d}}|\), where \(\lambda _i(L)\) is the i-th eigenvalue of Laplacian matrix of G, and \({\bar{d}}\) is their average. If \(\mathrm{{LE}}(G) = \mathrm{{LE}}(K_n)\) for the complete graph \(K_n\) of order n, then G is known as L-borderenergetic graph. In the first part of this paper, we construct three infinite families of non-complete disconnected L-borderenergetic graphs: \(\Lambda _1 = \{ G_{b,j,k} = [(((j-2)k-2j+2)b+1)K_{(j-1)k-(j-2)}] \cup b(K_j \times K_k)| b,j,k \in {{\mathbb {Z}}}^+\}\), \( \Lambda _2 = \{G_{2,b} = [K_6 \nabla b(K_2 \times K_3)] \cup (4b-2)K_9 | b\in {{\mathbb {Z}}}^+ \}\), \( \Lambda _3 = \{G_{3,b} = [bK_8 \nabla b(K_2 \times K_4)] \cup (14b-4)K_{8b+6} | b\in {{\mathbb {Z}}}^+ \}\), where \(\nabla \) is join operator and \(\times \) is direct product operator on graphs. Then, in the second part of this work, we construct new infinite families of non-complete connected L-borderenergetic graphs \(\Omega _1= \{K_2 \nabla \overline{aK_2^r} \vert a\in {{\mathbb {Z}}}^+\}\), \(\Omega _2 = \{\overline{aK_3 \cup 2(K_2\times K_3)}\vert a\in {{\mathbb {Z}}}^+ \}\) and \(\Omega _3 = \{\overline{aK_5 \cup (K_3\times K_3)}\vert a\in {{\mathbb {Z}}}^+ \}\), where \({\overline{G}}\) is the complement operator on G.
期刊介绍:
Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics.
Topics of interest include:
• semantics of programming languages
• models and modeling languages for concurrent, distributed, reactive and mobile systems
• models and modeling languages for timed, hybrid and probabilistic systems
• specification, program analysis and verification
• model checking and theorem proving
• modal, temporal, first- and higher-order logics, and their variants
• constraint logic, SAT/SMT-solving techniques
• theoretical aspects of databases, semi-structured data and finite model theory
• theoretical aspects of artificial intelligence, knowledge representation, description logic
• automata theory, formal languages, term and graph rewriting
• game-based models, synthesis
• type theory, typed calculi
• algebraic, coalgebraic and categorical methods
• formal aspects of performance, dependability and reliability analysis
• foundations of information and network security
• parallel, distributed and randomized algorithms
• design and analysis of algorithms
• foundations of network and communication protocols.